Search results for 'Undecidability' (try it on Scholar)

482 found
Sort by:
See also:
  1. Justin Clarke-Doane (2013). What is Absolute Undecidability?†. Noûs 47 (3):467-481.score: 24.0
    It is often alleged that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  2. Y. Sato & T. Ikegami (2004). Undecidability in the Imitation Game. Minds and Machines 14 (2):133-43.score: 24.0
    This paper considers undecidability in the imitation game, the so-called Turing Test. In the Turing Test, a human, a machine, and an interrogator are the players of the game. In our model of the Turing Test, the machine and the interrogator are formalized as Turing machines, allowing us to derive several impossibility results concerning the capabilities of the interrogator. The key issue is that the validity of the Turing test is not attributed to the capability of human or machine, (...)
    Direct download (20 more)  
     
    My bibliography  
     
    Export citation  
  3. Patrick Grim (1997). The Undecidability of the Spatialized Prisoner's Dilemma. Theory and Decision 42 (1):53-80.score: 24.0
    In the spatialized Prisoner's Dilemma, players compete against their immediate neighbors and adopt a neighbor's strategy should it prove locally superior. Fields of strategies evolve in the manner of cellular automata (Nowak and May, 1993; Mar and St. Denis, 1993a,b; Grim 1995, 1996). Often a question arises as to what the eventual outcome of an initial spatial configuration of strategies will be: Will a single strategy prove triumphant in the sense of progressively conquering more and more territory without opposition, or (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Rodolfo Gambini, Luis Pedro García Pintos & Jorge Pullin (2010). Undecidability and the Problem of Outcomes in Quantum Measurements. Foundations of Physics 40 (1):93-115.score: 24.0
    We argue that it is fundamentally impossible to recover information about quantum superpositions when a quantum system has interacted with a sufficiently large number of degrees of freedom of the environment. This is due to the fact that gravity imposes fundamental limitations on how accurate measurements can be. This leads to the notion of undecidability: there is no way to tell, due to fundamental limitations, if a quantum system evolved unitarily or suffered wavefunction collapse. This in turn provides a (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Miklós Erdélyi-Szabó (2000). Undecidability of the Real-Algebraic Structure of Models of Intuitionistic Elementary Analysis. Journal of Symbolic Logic 65 (3):1014-1030.score: 24.0
    We show that true first-order arithmetic is interpretable over the real-algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras. From this the undecidability of the structures follows. We also show that Scott's model is equivalent to true second-order arithmetic. In the appendix we argue that undecidability on the language of ordered rings follows from intuitionistically plausible properties of the real numbers.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Sylvie Avakian (forthcoming). 'Undecidability' or 'Anticipatory Resoluteness' Caputo in Conversation with Heidegger. International Journal for Philosophy of Religion:1-17.score: 24.0
    In this article I will consider John D. Caputo’s ‘radical hermeneutics’, with ‘undecidability’ as its major theme, in conversation with Martin Heidegger’s notion of ‘anticipatory resoluteness’. Through an examination of the positions of Caputo and Heidegger I argue that Heidegger’s notion of ‘anticipatory resoluteness’ reaches far beyond the claims of ‘radical hermeneutics’, and that it assumes a reconstructive process which carries within its scope the overtones of deconstruction, the experience of repetition and authenticity and also the implications of Gelassenheit. (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Leon Horsten & Philip Welch (2007). The Undecidability of Propositional Adaptive Logic. Synthese 158 (1):41 - 60.score: 22.0
    We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and (...)
    No categories
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  8. Ying‐Fang Kao, V. Ragupathy, K. Vela Velupillai & Stefano Zambelli (2012). Noncomputability, Unpredictability, Undecidability, and Unsolvability in Economic and Finance Theories. Complexity 18 (1):51-55.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Thomas Brihaye (2006). A Note on the Undecidability of the Reachability Problem for o‐Minimal Dynamical Systems. Mathematical Logic Quarterly 52 (2):165-170.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. Miklós Erdélyi-Szabó (1998). Undecidability of the Real-Algebraic Structure of Scott's Model. Mathematical Logic Quarterly 44 (3):344-348.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Stephen Barker (2014). Semantic Paradox and Alethic Undecidability. Analysis 74 (2):201-209.score: 18.0
    I use the principle of truth-maker maximalism to provide a new solution to the semantic paradoxes. According to the solution, AUS, its undecidable whether paradoxical sentences are grounded or ungrounded. From this it follows that their alethic status is undecidable. We cannot assert, in principle, whether paradoxical sentences are true, false, either true or false, neither true nor false, both true and false, and so on. AUS involves no ad hoc modification of logic, denial of the T-schema's validity, or obvious (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Andrzej Grzegorczyk (2005). Undecidability Without Arithmetization. Studia Logica 79 (2):163 - 230.score: 18.0
    In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Peter Koellner (2010). On the Question of Absolute Undecidability. In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: Essays for His Centennial. Association for Symbolic Logic. 153-188.score: 18.0
    The paper begins with an examination of Gödel's views on absolute undecidability and related topics in set theory. These views are sharpened and assessed in light of recent developments. It is argued that a convincing case can be made for axioms that settle many of the questions undecided by the standard axioms and that in a precise sense the program for large cardinals is a complete success “below” CH. It is also argued that there are reasonable scenarios for settling (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  14. Jack Reynolds (2002). Habituality and Undecidability: A Comparison of Merleau-Ponty and Derrida on the Decision. International Journal of Philosophical Studies 10 (4):449 – 466.score: 18.0
    This essay examines the relationship that obtains between Merleau-Ponty and Derrida through exploring an interesting point of dissension in their respective accounts of decision-making. Merleau-Ponty's early philosophy emphasizes the body-subject's tendency to seek an equilibrium with the world (by acquiring skills and establishing what he refers to as 'intentional arcs'), and towards deciding in an embodied and habitual manner that minimizes any confrontation with what might be termed a decision-making aporia. On the other hand, in his later writings, Derrida frequently (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Patrick Grim, Undecidability in the Spatialized Prisoner's Dilemma: Some Philosophical Implications.score: 18.0
    A version of this paper was presented at the IEEE International Conference on Computational Intelligence, combined meeting of ICNN, FUZZ-IEEE, and ICEC, Orlando, June-July, 1994, and an earlier form of the result is to appear as "The Undecidability of the Spatialized Prisoner's Dilemma" in Theory and Decision . An interactive form of the paper, in which figures are called up as evolving arrays of cellular automata, is available on DOS disk as Research Report #94-04i . An expanded version appears (...)
     
    My bibliography  
     
    Export citation  
  16. Franco Montagna (1980). The Undecidability of the First-Order Theory of Diagonalizable Algebras. Studia Logica 39 (4):355 - 359.score: 18.0
    The undecidability of the first-order theory of diagonalizable algebras is shown here.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  17. J. Siekmann & P. Szabó (1989). The Undecidability of the DA-Unification Problem. Journal of Symbolic Logic 54 (2):402 - 414.score: 18.0
    We show that the D A -unification problem is undecidable. That is, given two binary function symbols $\bigoplus$ and $\bigotimes$ , variables and constants, it is undecidable if two terms built from these symbols can be unified provided the following D A -axioms hold: \begin{align*}(x \bigoplus y) \bigotimes z &= (x \bigotimes z) \bigoplus (y \bigotimes z),\\x \bigotimes (y \bigoplus z) &= (x \bigotimes y) \bigoplus (x \bigotimes z),\\x \bigoplus (y \bigoplus z) &= (x \bigoplus y) \bigoplus z.\end{align*} Two terms (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Ross Willard (1994). Hereditary Undecidability of Some Theories of Finite Structures. Journal of Symbolic Logic 59 (4):1254-1262.score: 18.0
    Using a result of Gurevich and Lewis on the word problem for finite semigroups, we give short proofs that the following theories are hereditarily undecidable: (1) finite graphs of vertex-degree at most 3; (2) finite nonvoid sets with two distinguished permutations; (3) finite-dimensional vector spaces over a finite field with two distinguished endomorphisms.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. Stuart Dalton (1998). Unity and Undecidability. Philosophy in the Contemporary World 5 (4):25-32.score: 18.0
    This essay argues that, in the first Critique, the need for unity leads Kant to re-inscribe the subject in a situation of multiplicity and undecidability. The result, however, is not a relativization that negates the meaning of the subject’s existence, but rather a contextualization that makes meaning possible. This reading clarifies some of the connections between Kant and contemporary postmodernism, especially the work of Jacques Derrida.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  20. Erich Grädel, Martin Otto & Eric Rosen (1999). Undecidability Results on Two-Variable Logics. Archive for Mathematical Logic 38 (4-5):313-354.score: 18.0
    It is a classical result of Mortimer that $L^2$ , first-order logic with two variables, is decidable for satisfiability. We show that going beyond $L^2$ by adding any one of the following leads to an undecidable logic:– very weak forms of recursion, viz.¶(i) transitive closure operations¶(ii) (restricted) monadic fixed-point operations¶– weak access to cardinalities, through the Härtig (or equicardinality) quantifier¶– a choice construct known as Hilbert's $\epsilon$ -operator.In fact all these extensions of $L^2$ prove to be undecidable both for satisfiability, (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Robin Hirsch & Marcel Jackson (2012). Undecidability of Representability as Binary Relations. Journal of Symbolic Logic 77 (4):1211-1244.score: 18.0
    In this article we establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson's relation algebra. We also establish a number of undecidability results for representability as algebras of injective functions.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Derrick L. Hassert Kevin B. Clark (2013). Undecidability and Opacity of Metacognition in Animals and Humans. Frontiers in Psychology 4.score: 18.0
    Undecidability and opacity of metacognition in animals and humans.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  23. J. Siekmann & P. Szabo (1989). The Undecidability of the $Mathrm{D}_mathrm{A}$-Unification Problem. Journal of Symbolic Logic 54 (2):402-414.score: 18.0
    We show that the $\mathrm{D_A}$-unification problem is undecidable. That is, given two binary function symbols $\bigoplus$ and $\bigotimes$, variables and constants, it is undecidable if two terms built from these symbols can be unified provided the following $\mathrm{D_A}$-axioms hold: \begin{align*}(x \bigoplus y) \bigotimes z &= (x \bigotimes z) \bigoplus (y \bigotimes z),\\x \bigotimes (y \bigoplus z) &= (x \bigotimes y) \bigoplus (x \bigotimes z),\\x \bigoplus (y \bigoplus z) &= (x \bigoplus y) \bigoplus z.\end{align*} Two terms are $\mathrm{D_A}$-unifiable (i.e. an equation (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Sanford Shieh (1998). Undecidability in Anti-Realism. Philosophia Mathematica 6 (3):324-333.score: 16.0
    In this paper I attempt to clarify a relatively little-studied aspect of Michael Dummett's argument for intuitionism: its use of the notion of ‘undecidable’ sentence. I give a new analysis of this concept in epistemic terms, with which I resolve some puzzles and questions about how it works in the anti-realist critique of classical logic.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Andrea Cantini (2003). The Undecidability of Grisin's Set Theory. Studia Logica 74 (3):345 - 368.score: 16.0
    We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  26. Franco Montagna & Hiroakira Ono (2002). Kripke Semantics, Undecidability and Standard Completeness for Esteva and Godo's Logic MTL∀. Studia Logica 71 (2):227-245.score: 16.0
    The present paper deals with the predicate version MTL of the logic MTL by Esteva and Godo. We introduce a Kripke semantics for it, along the lines of Ono''s Kripke semantics for the predicate version of FLew (cf. [O85]), and we prove a completeness theorem. Then we prove that every predicate logic between MTL and classical predicate logic is undecidable. Finally, we prove that MTL is complete with respect to the standard semantics, i.e., with respect to Kripke frames on the (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  27. D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.score: 16.0
    Let S be a deductive system such that S-derivability (⊦s) is arithmetic and sound with respect to structures of class K. From simple conditions on K and ⊦s, it follows constructively that the K-completeness of ⊦s implies MP(S), a form of Markov's Principle. If ⊦s is undecidable then MP(S) is independent of first-order Heyting arithmetic. Also, if ⊦s is undecidable and the S proof relation is decidable, then MP(S) is independent of second-order Heyting arithmetic, HAS. Lastly, when ⊦s is many-one (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. P. T. Bateman, C. G. Jockusch & A. R. Woods (1993). Decidability and Undecidability of Theories with a Predicate for the Primes. Journal of Symbolic Logic 58 (2):672-687.score: 16.0
    It is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure $\langle \omega; +, P\rangle$ , where P is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of $\langle\omega; S, P\rangle$ is decidable, where S is the successor function. The latter result is proved using a general (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  29. Roman Kontchakov, Agi Kurucz & Michael Zakharyaschev (2005). Undecidability of First-Order Intuitionistic and Modal Logics with Two Variables. Bulletin of Symbolic Logic 11 (3):428-438.score: 16.0
    We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the two-variable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of practically all standard modal logics like K, K4, GL, S4, S5, K4.1, S4.2, GL.3, etc.). For many quantified modal logics, including those (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  30. Matthew W. Parker (2003). Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System. Philosophy of Science 70 (2):359-382.score: 16.0
    Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  31. Steffen Lempp & Andre Nies (1995). The Undecidability of the II$^_4$ Theory for the R. E. Wtt and Turing Degrees. Journal of Symbolic Logic 60 (4):1118-1136.score: 16.0
    We show that the $\Pi_4$-theory of the partial order of recursively enumerable weak truth-table degrees is undecidable, and give a new proof of the similar fact for r.e. T-degrees. This is accomplished by introducing a new coding scheme which consists in defining the class of finite bipartite graphs with parameters.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  32. V. Yu Shavrukov (1997). Undecidability in Diagonalizable Algebras. Journal of Symbolic Logic 62 (1):79-116.score: 16.0
    If a formal theory T is able to reason about its own syntax, then the diagonalizable algebra of T is defined as its Lindenbaum sentence algebra endowed with a unary operator □ which sends a sentence φ to the sentence □φ asserting the provability of φ in T. We prove that the first order theories of diagonalizable algebras of a wide class of theories are undecidable and establish some related results.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  33. Yves Lafont (1996). The Undecidability of Second Order Linear Logic Without Exponentials. Journal of Symbolic Logic 61 (2):541-548.score: 16.0
    Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of two-counter machines originally due to Kanovich. The faithfulness of this encoding is (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  34. Evgeny Zolin (2014). Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi. Studia Logica 102 (5):1021-1039.score: 16.0
    We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Gilles Amiot (1990). The Undecidability of the Second Order Predicate Unification Problem. Archive for Mathematical Logic 30 (3):193-199.score: 16.0
    We prove that the second order predicate unification problem is undecidable by reducing the second order term unification problem to it.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  36. Steffen Lempp & André Nies (1995). The Undecidability of the II4 Theory for the R. E. Wtt and Turing Degrees. Journal of Symbolic Logic 60 (4):1118 - 1136.score: 16.0
    We show that the Π 4 -theory of the partial order of recursively enumerable weak truth-table degrees is undecidable, and give a new proof of the similar fact for r.e. T-degrees. This is accomplished by introducing a new coding scheme which consists in defining the class of finite bipartite graphs with parameters.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Saul A. Kripke (1962). The Undecidability of Monadic Modal Quantification Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (2):113-116.score: 15.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Maria Poulaki (2012). The Subject Trapped in Gomorrah : Undecidability and Choice in Network Cinema. Film-Philosophy 16 (1):55-71.score: 15.0
    This paper uses the recent ‘network film’ of Mateo Garrone Gomorrah in order to let Alain Badiou’s theory of subjectivization-in-decision percolate through the immanent networks of contemporary ‘risk societies’ and the narrative structures through which they find expression in cinema. Adumbrating a tension between choices and decisions I seek to create ‘edges’ between two worlds that in the most part of Badiou’s work have been decisively and platonically separated: the world of being and the one of our embodied social experience. (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  39. Peter Smith, Incompleteness and Undecidability.score: 15.0
    In Episode 1, we introduced the very idea of a negation-incomplete formalized theory T . We noted that if we aim to construct a theory of basic arithmetic, we’ll ideally like the theory to be able to prove all the truths expressible in the language of basic arithmetic, and hence to be negation complete. But Gödel’s First Incompleteness Theorem says, very roughly, that a nice theory T containing enough arithmetic will always be negation incomplete. Now, the Theorem comes in two (...)
    No categories
     
    My bibliography  
     
    Export citation  
  40. Panu Raatikainen (2000). Algorithmic Information Theory and Undecidability. Synthese 123 (2):217-225.score: 15.0
    Algorithmic information theory, or the theory of Kolmogorov complexity, has become an extraordinarily popular theory, and this is no doubt due, in some part, to the fame of Chaitin’s incompleteness results arising from this field. Actually, there are two rather different results by Chaitin: the earlier one concerns the finite limit of the provability of complexity (see Chaitin, 1974a, 1974b, 1975a); and the later is related to random reals and the halting probability (see Chaitin, 1986, 1987a, 1987b, 1988, 1989.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  41. B. Mazur (1994). Questions of Decidability and Undecidability in Number Theory. Journal of Symbolic Logic 59 (2):353-371.score: 15.0
  42. Hilary Putnam (1957). Decidability and Essential Undecidability. Journal of Symbolic Logic 22 (1):39-54.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Mark A. Changizi (1999). Vagueness, Rationality and Undecidability: A Theory of Why There is Vagueness. Synthese 120 (3):345 - 374.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  44. Alison Ross (2004). Historical Undecidability: The Kantian Background to Derrida's Politics. International Journal of Philosophical Studies 12 (4):375 – 393.score: 15.0
    This paper deals with Derrida's analysis of Kant's Critique of Judgment in his essay 'Economimesis'. I argue that Derrida's analysis of Kant's aesthetics can be used to describe the aporia within Kantian politics between rebellion and progressive revolutionary acts. The focus of my argument falls on examining how the recent debate over Derrida's ethics can be usefully considered from the background of this treatment of Kant. In particular, the analysis Derrida gives of Kant's aesthetics commits him to a series of (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  45. Calvin C. Elgot & Michael O. Rabin (1966). Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. Journal of Symbolic Logic 31 (2):169-181.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  46. Dharmendra Kumar (1969). Neutrality, Contingency and Undecidability. British Journal for the Philosophy of Science 19 (4):353-356.score: 15.0
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  47. Alexander Chagrov & Michael Zakharyaschev (1993). The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems. Journal of Symbolic Logic 58 (3):967-1002.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  48. Newton C. A. da Costa & Francisco A. Doria (1995). Undecidability, Incompleteness and Arnol'D Problems. Studia Logica 55 (1):23 - 32.score: 15.0
    We present some recent technical results of us on the incompleteness of classical analysis and then discuss our work on the Arnol'd decision problems for the stability of fixed points of dynamical systems.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  49. Leon Horsten & Philip Welch (2009). Erratum: The Undecidability of Propositional Adaptive Logic. Synthese 169 (1):217 - 218.score: 15.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  50. Alasdair Urquhart (1984). The Undecidability of Entailment and Relevant Implication. Journal of Symbolic Logic 49 (4):1059-1073.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 482