Log in

Relevant bibliographies by topics / Undecidable

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Undecidable'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Undecidable.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Undecidable"

1

da Costa, N. C. A., and F. A. Doria. "Undecidable hopf bifurcation with undecidable fixed point." International Journal of Theoretical Physics 33, no. 9 (September 1994): 1885–903. http://dx.doi.org/10.1007/bf00671031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bennett, Charles H. "Undecidable dynamics." Nature 346, no. 6285 (August 1990): 606–7. http://dx.doi.org/10.1038/346606a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Myasnikov, Alexei G., and Alexander N. Rybalov. "Generic complexity of undecidable problems." Journal of Symbolic Logic 73, no. 2 (June 2008): 656–73. http://dx.doi.org/10.2178/jsl/1208359065.

Full text

Abstract:

AbstractIn this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every strongly generic subset of inputs. For instance, the classical Halting Problem is strongly undecidable. Moreover, we prove an analog of the Rice theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. Then we show that there are natural super-undecidable problems, i.e., problem which are undecidable on every generic (not only strongly generic) subset of inputs. In particular, there are finitely presented semigroups with super-undecidable word problem. To construct strongly- and super-undecidable problems we introduce a method of generic amplification (an analog of the amplification in complexity theory). Finally, we construct absolutely undecidable problems, which stay undecidable on every non-negligible set of inputs. Their construction rests on generic immune sets.

APA, Harvard, Vancouver, ISO, and other styles

4

Stewart, Ian. "Deciding the undecidable." Nature 352, no. 6337 (August 1991): 664–65. http://dx.doi.org/10.1038/352664a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kapovich, Michael. "Discreteness is undecidable." International Journal of Algebra and Computation 26, no. 03 (May 2016): 467–72. http://dx.doi.org/10.1142/s0218196716500193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Maddux, Roger D. "Undecidable semiassociative relation algebras." Journal of Symbolic Logic 59, no. 2 (June 1994): 398–418. http://dx.doi.org/10.2307/2275397.

Full text

Abstract:

AbstractIf K is a class of semiassociative relation algebras and K contains the relation algebra of all binary relations on a denumerable set, then the word problem for the free algebra over K on one generator is unsolvable. This result implies that the set of sentences which are provable in the formalism ℒw× is an undecidable theory. A stronger algebraic result shows that the set of logically valid sentences in ℒw× forms a hereditarily undecidable theory in ℒw×. These results generalize similar theorems, due to Tarski, concerning relation algebras and the formalism ℒ×.

APA, Harvard, Vancouver, ISO, and other styles

7

Janicaud, Dominique. "Metamorphosis of the Undecidable." Graduate Faculty Philosophy Journal 13, no. 1 (1988): 125–40. http://dx.doi.org/10.5840/gfpj19881317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bokov, G. V. "Undecidable Iterative Propositional Calculus." Algebra and Logic 55, no. 4 (September 2016): 274–82. http://dx.doi.org/10.1007/s10469-016-9396-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Straßburger, Lutz. "System NEL is Undecidable." Electronic Notes in Theoretical Computer Science 84 (September 2003): 166–77. http://dx.doi.org/10.1016/s1571-0661(04)80853-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Saito, A., and K. Kaneko. "Geometry of Undecidable Systems." Progress of Theoretical Physics 99, no. 5 (May 1, 1998): 885–90. http://dx.doi.org/10.1143/ptp.99.885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Undecidable"

1

WANG, Yi, Masahiko SAKAI, Naoki NISHIDA, Toshiki SAKABE, and Keiichirou KUSAKARI. "Confluence of Length Preserving String Rewriting Systems is Undecidable." 京都大学数理解析研究所, 2007. http://hdl.handle.net/2237/9353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

St, John Gavin. "On formally undecidable propositions of Zermelo-Fraenkel set theory." Youngstown State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1369657108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Weiger, Rebecca. "Imaginary Specters, Imagined Listeners: The Undecidable in Graham Swift's Tomorrow and Mothering Sunday." Thesis, Malmö universitet, Malmö högskola, Institutionen för konst, kultur och kommunikation (K3), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-42950.

Full text

Abstract:

This paper aims to investigate the possible connection between specters and silence in Graham Swift’s Tomorrow (2007) and Mothering Sunday (2016). In both novels, the protagonists predominantly speak in interior monologues, recounting the memories and secrets that haunt them, in what could be construed as an attempt to exorcise the ghosts of their past. The paper’s understanding of specters is based on Jacques Derrida’s Specters of Marx (1993), and the idea that specters - as figures that exist in states of in-between - disrupt not only temporality, but what we know to be true. Much like specters, the protagonists vacillate between states, neither speaking nor remaining silent, as they address absent or imagined listeners. This undecidability leaves one to wonder if their ghosts are - or ever can be - truly exorcised.

APA, Harvard, Vancouver, ISO, and other styles

4

Mardell, Emma. "Questioning the boundaries between fast- and slow fashion." Thesis, Stockholms universitet, Företagsekonomiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-143065.

Full text

Abstract:

Individual’s existential ambivalence has according to Jacques Derrida, one of the foremost proponents of post-structuralism, led to a continuous demand for structure (Cooper, 1989). Categories, used as structural tools, are however often hierarchically organized, where one category is more preferable than the other, also referred to as binary oppositions. Alternative categories and/ or references will appear when adopting a deconstruction process, which is crucial in order to invoke change and development (Cooper, 1989; Markkula et al., 2011; Marion, 2006). The aim of present research is trying to identify if Derrida’s theory of undecidable transfer of features (Agger, 1991; Cooper, 1989; Livingston, 2010; Bates, 2005) is applicable in fashion, more specifically fast- and slow fashion, and if the two categories are susceptible to a merge. Deconstructionism and Derrida’s theory of undecidable was furthermore applied as the theoretical framework throughout the study. Present research has been executed with an interpretive methodological approach and through a poststructural epistemological outlook (Hudson & Ozanne, 1988; Eriksson & Kovalainen, 2016). Data was derived through two focus group interviews, involving seven informants at a time, with Autodriving as a visual research tool (Heisley & Levy, 1991) and open-ended questions as a complementing instrument (Eriksson & Kovalainen, 2016). A thematic analysis was furthermore applied when revisiting the data and analysing its content. The findings finally suggest that a merge between fast- and slow fashion is executable, which furthermore also legitimises Derrida’s theory of undecidability. This study has however only begun the deconstruction process and does therefore encourage future researchers to continue investigating the theory of undecidability (Agger, 1991; Cooper, 1989; Livingston, 2010; Bates, 2005) not only in fashion, but also within other institutions.

APA, Harvard, Vancouver, ISO, and other styles

5

Sakai, Masahiko, and Yi Wang. "Undecidable Properties on Length-Two String Rewriting Systems." 2007. http://hdl.handle.net/2237/9237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Turner, Amber Denean 1982. "Resignifying resistance : transnational black feminism and performativity in the U.S. prison industrial complex." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-05-1499.

Full text

Abstract:

The circumstance of mass incarceration in the U.S. has reached the point of social crisis. When the statistics on imprisonment are demographically disaggregated, they point to the overrepresentation of imprisoned men and women of color. Paying special attention to Black men and women, critical race, prison advocacy, and Black feminist research has been vital in theorizing the structural and ideological implications of this racial inequity. The insight that the U.S. prison system constitutes a prison industrial complex arose from such scholarship. More recently, transnational feminism has offered insight into the specific experience and socio-historical contextualization of raced women within a transnational prison industrial complex. Based on transnational and Black feminist precepts, this thesis will argue the need to reframe the discursive position of imprisoned Black women in liberatory discourse. Using the work of Homi K. Bhabha, I contend that Black women’s discursive positions should be understood as “culturally undecidable.” Dominant paradigms of mainstream feminism have assigned Black women the task of fulfilling the ideal of “true womanhood.” Black feminist scholars have argued that this model erases and marginalizes Black women’s resistance. I suggest the imposition of this ideal rhetorically fixes Black women as victims, pathologizes them, and ultimately pathologizes the Black community. In contrast, renaming Black women’s discursive position as “culturally undecidable” creates the possibility to decenter the transnational networks that underpin the transnational prison industrial complex. To proffer this argument, I will analyze performative resistances and reifications of criminalization within narratives of imprisoned Black women and suggest performance practices to encourage Black women’s sense of agency.
text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Undecidable"

1

Andrzej, Mostowski, and Robinson, Raphael M. (Raphael Mitchel), 1911-, eds. Undecidable theories. Mineola, N.Y: Dover Publications, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Groote, J. F. Undecidable equivalences for Basic Process Algebra. Edinburgh: University of Edinburgh, Laboratory for Foundations of Computer Science, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hüttel, Hans. Undecidable equivalences for basic parallel processes. Edinburgh: LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

1945-, Doria Francisco A., and Costa, Newton C. A. da, eds. Gödel's way: Exploits into an undecidable world. Boca Raton: CRC Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gödel, Kurt. On formally undecidable propositions ofPrincipia mathematica and related systems. New York: Dover Pubns., 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gödel, Kurt. On formally undecidable propositions of Principia mathematica and related systems. New York, USA: Dover Publications, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Davis, Martin. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Dover Publications, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

1928-, Davis Martin, ed. The undecidable: Basic papers on undecidable propositions, unsolvable problems, and computable functions. Mineola, NY: Dover Publication, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chaitin, Gregory, Francisco A. Doria, and Newton C. A. da Costa. Goedel's Way: Exploits into an Undecidable World. Taylor & Francis Group, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chaitin, Gregory, Francisco A. Doria, and Newton C. A. da Costa. Goedel's Way: Exploits into an Undecidable World. Taylor & Francis Group, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Undecidable"

1

Shoenfield, Joseph R. "Undecidable Theories." In Lecture Notes in Logic, 32–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-22378-9_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bukovský, Lev. "Undecidable Statements." In The Structure of the Real Line, 415–54. Basel: Springer Basel, 2011. http://dx.doi.org/10.1007/978-3-0348-0006-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Börger, Egon, Erich Grädel, and Yuri Gurevich. "Other Undecidable Cases." In The Classical Decision Problem, 189–235. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59207-2_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Reus, Bernhard. "More Undecidable Problems." In Undergraduate Topics in Computer Science, 97–112. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27889-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Booth, David, and Renatus Ziegler. "Are There Undecidable Propositions?" In Finsler Set Theory: Platonism and Circularity, 63–72. Basel: Birkhäuser Basel, 1996. http://dx.doi.org/10.1007/978-3-0348-9031-1_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Chao, Yi Lv, Gaoang Liu, and Peng Wu. "Quasi-Linearizability is Undecidable." In Programming Languages and Systems, 369–86. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26529-2_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Selivanov, Victor L. "A Useful Undecidable Theory." In Lecture Notes in Computer Science, 685–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73001-9_73.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kozen, Dexter C. "Decidable and Undecidable Problems." In Automata and Computability, 235–38. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_40.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kozen, Dexter C. "Undecidable Problems About CFLs." In Automata and Computability, 249–55. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mayr, Richard. "Undecidable Problems in Unreliable Computations." In Lecture Notes in Computer Science, 377–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10719839_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Undecidable"

1

Bojanczyk, Mikolaj, Edon Kelmendi, and Michal Skrzypczak. "MSO+∇ is undecidable." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785892.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pierce, Benjamin C. "Bounded quantification is undecidable." In the 19th ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/143165.143228.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gafni, Eli, and Elias Koutsoupias. "3-processor tasks are undecidable." In the fourteenth annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/224964.225009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Selcuk, Ali Aydin, Fatih Orhan, and Berker Batur. "Undecidable problems in malware analysis." In 2017 12th International Conference for Internet Technology and Secured Transactions (ICITST). IEEE, 2017. http://dx.doi.org/10.23919/icitst.2017.8356458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Boehm, Hans-J. "Partial polymorphic type inference is undecidable." In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE, 1985. http://dx.doi.org/10.1109/sfcs.1985.44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lê Cong, Sébastien, Sophie Pinchinat, and François Schwarzentruber. "Small Undecidable Problems in Epistemic Planning." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/664.

Full text

Abstract:

Epistemic planning extends classical planning with knowledge and is based on dynamic epistemic logic (DEL). The epistemic planning problem is undecidable in general. We exhibit a small undecidable subclass of epistemic planning over 2-agent S5 models with a fixed repertoire of one action, 6 propositions and a fixed goal. We furthermore consider a variant of the epistemic planning problem where the initial knowledge state is an automatic structure, hence possibly infinite. In that case, we show the epistemic planning problem with 1 public action and 2 propositions to be undecidable, while it is known to be decidable with public actions over finite models. Our results are obtained by reducing the reachability problem over small universal cellular automata. While our reductions yield a goal formula that displays the common knowledge operator, we show, for each of our considered epistemic problems, a reduction into an epistemic planning problem for a common-knowledge-operator-free goal formula by using 2 additional actions.

APA, Harvard, Vancouver, ISO, and other styles

7

Kuznetsov, Stepan. "The Logic of Action Lattices is Undecidable." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785659.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Conti, Mauro, Ankit Gangwal, and Michele Todero. "Blockchain Trilemma Solver Algorand has Dilemma over Undecidable Messages." In ARES '19: 14th International Conference on Availability, Reliability and Security. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3339252.3339255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gogacz, Tomasz, and Jerzy Marcinkowski. "The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bednarczyk, Bartosz, Robert Ferens, and Piotr Ostropolski-Nalewaja. "All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/238.

Full text

Abstract:

The chase is a famous algorithmic procedure in database theory with numerous applications in ontology-mediated query answering. We consider static analysis of the chase termination problem, which asks, given set of TGDs, whether the chase terminates on all input databases. The problem was recently shown to be undecidable by Gogacz et al. for sets of rules containing only ternary predicates. In this work, we show that undecidability occurs already for sets of single-head TGD over binary vocabularies. This question is relevant since many real-world ontologies, e.g., those from the Horn fragment of the popular OWL, are of this shape.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!