Undecidable theories
From MaRDI portal
Publication:2651342
zbMath0053.00401MaRDI QIDQ2651342
Andrzej Mostowski, Raphael M. Robinson
Publication date: 1953
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Zur axiomatisierbarkeit von theorien in der schwachen logik der zweiten stufe ⋮ Deduction-preserving “recursive isomorphisms” between theories ⋮ MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES ⋮ Satisfaction for n-th order languages defined in n-th order languages ⋮ “Recursive isomorphism” and effectively extensible theories ⋮ HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? ⋮ Logische Kategorien ⋮ Report on attainability of systems of identities ⋮ An Equivalence Between Nonassociative Ring Theory and the Theory of a Special Class of Groups ⋮ SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS ⋮ FMP-ensuring logics, RA-ensuring logics and FA-ensuring logics in NExtK4.3 ⋮ The theory of hereditarily bounded sets ⋮ On interpretations of Presburger arithmetic in Büchi arithmetics ⋮ Core Gödel ⋮ TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES ⋮ ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM ⋮ Recursively enumerable classes and their application to recursive sequences of formal theories ⋮ A step towards absolute versions of metamathematical results ⋮ Algebraic and logical aspects of unification ⋮ Recursive functions and existentially closed structures ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ INCOMPLETENESS VIA PARADOX AND COMPLETENESS ⋮ Independent Recursive Axiomatizability in Arithmetic ⋮ Unnamed Item ⋮ The Absence of Multiple Universes of Discourse in the 1936 Tarski Consequence-Definition Paper ⋮ A View of Revival of Mathematical Logic in Warsaw, 1945–1975 ⋮ Andrzej Mostowski and the Notion of a Model ⋮ Semantic limits of dense combinatorial objects ⋮ ON A QUESTION OF KRAJEWSKI’S ⋮ Possible world semantics for analogous reasoning ⋮ On the strength of some topological lattices ⋮ MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY ⋮ Representability of Partial Recursive Functions in Formal Theories ⋮ Representability of recursively enumerable sets in formal theories ⋮ Representability op recursively enumerable sets in formal theories ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ COORDINATE-FREE LOGIC ⋮ RESTRICTIVENESS RELATIVE TO NOTIONS OF INTERPRETATION ⋮ SELF-REFERENCE IN ARITHMETIC I ⋮ Predicative logic and formal arithmetic ⋮ Rules and arithmetics ⋮ The substitutional analysis of logical consequence ⋮ Essential hereditary undecidability ⋮ A weak theory of building blocks ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics ⋮ Pour-El's landscape ⋮ Creativity and Effective Inseparability ⋮ Exact Separation of Recursively Enumerable Sets Within Theories ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Unnamed Item ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ A NOTE ON DERIVABILITY CONDITIONS ⋮ Neo-Logicism and Its Logic ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ Hilbert's tenth problem over function fields of positive characteristic not containing the algebraic closure of a finite field ⋮ Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint ⋮ Intertheoretic reduction, confirmation, and Montague's syntax-semantics relation ⋮ Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries ⋮ Uncertainty, predictability and decidability in chaotic dynamical systems ⋮ Book review: Leon Horsten, The Tarskian turn. Deflationism and axiomatic truth. ⋮ A Fortuitous Year with Leon Henkin ⋮ Undecidability of free pseudo-complemented semilattices ⋮ Decidability and completeness for open formulas of membership theories ⋮ On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups ⋮ On constructivity and the Rosser property: a closer look at some Gödelean proofs ⋮ CONSISTENCY AND THE THEORY OF TRUTH ⋮ Coproduct and amalgamation of deductive systems by means of ordered algebras ⋮ The interpretability and scalability of linguistic-rule-based systems for solving regression problems ⋮ On the number of steps in proofs ⋮ Interpretability suprema in Peano arithmetic ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ The calculus of relations as a foundation for mathematics ⋮ The definability of fields ⋮ TRUTH AND SPEED-UP ⋮ Tarski on logical consequences ⋮ Passive induction and a solution to a Paris-Wilkie open question ⋮ A comprehensive picture of the decidability of mereological theories ⋮ Complexity in Young's lattice ⋮ Bases for structures and theories. I. ⋮ Existentially complete lattice-ordered groups ⋮ On \(\mathsf{Q}\) ⋮ On the possibility of inference to the best explanation ⋮ The logical strength of compositional principles ⋮ Provability and interpretability logics with restricted realizations ⋮ Weak theories of concatenation and arithmetic ⋮ Independence results in computer science? ⋮ Models and the dynamics of theory-building in physics. I: Modeling strategies ⋮ Some Universal Sets of Terms ⋮ The decision problem for database dependencies ⋮ Foundations of boundedly rational choice and satisficing decisions ⋮ On logics with two variables ⋮ Quantification for Peirce's preferred system of triadic logic ⋮ A note on uniform density in weak arithmetical theories ⋮ On the weak definability in set theory ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) ⋮ On von Neumann regular rings with an automorphism ⋮ General iteration and unary functions
This page was built for publication: Undecidable theories
