scientific article
From MaRDI portal
Publication:4001935
zbMath0744.03037MaRDI QIDQ4001935
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independencemodels of arithmeticGödel's incompleteness theoremsrecursive saturationindicatorsextensions of models
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)
Related Items
On the value group of a model of Peano arithmetic, Automorphisms of models of true arithmetic: Recognizing some basic open subgroups, End extensions of models of weak arithmetic theories, The spectrum of elementary embeddings \(j: V \to V\), Space- and time-dependent scaling of numbers in mathematical structures: effects on physical and geometric quantities, Duality, non-standard elements, and dynamic properties of r.e. sets, Truth, dependence and supervaluation: living with the ghost, On the metamathematics of the P vs. NP question, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Full satisfaction classes, definability, and automorphisms, Inconsistent models of arithmetic. I: Finite models, Adding a conditional to Kripke's theory of truth, Automorphisms of models of arithmetic: a unified view, Automorphisms of countable recursively saturated models of PA: A survey, Four problems concerning recursively saturated models of arithmetic, Arithmetically saturated models of arithmetic, The theory of \(\kappa\)-like models of arithmetic, Normal subgroups of nonstandard symmetric and alternating groups, Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\), Models of weak theories of truth, The incompleteness theorems after 70 years, Toward the limits of the Tennenbaum phenomenon, Pell equations and exponentiation in fragments of arithmetic, Local collection and end-extensions of models of compositional truth, Passive induction and a solution to a Paris-Wilkie open question, Informal versus formal mathematics, Simplicity via provability for universal prefix-free Turing machines, To be or not to be constructive, that is not the question, Constant regions in models of arithmetic, Theories of truth without standard models and Yablo's sequences, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, Completeness of Hoare logic with inputs over the standard model, On nonelementarily equivalent pairs of fields, From Dedekind to Zermelo versus Peano to Gödel, On \(\mathsf{Q}\), Axiomatization and models of scientific theories, Bootstrapping. I, Truth in generic cuts, Nonstandard arithmetic and recursive comprehension, End extensions of models of fragments of \(\mathrm{PA}\), Tanaka's theorem revisited, Intuitionistic axiomatizations for bounded extension Kripke models., Intuitionistic nonstandard bounded modified realisability and functional interpretation, Fixed points of self-embeddings of models of arithmetic, Provability logic: models within models in Peano arithmetic, The \(\mathbf{M}\)-computations induced by accessibility relations in nonstandard models \(\mathbf{M}\) of Hoare logic, Algebraic combinatorics in bounded induction, \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction, Combinatorial unprovability proofs and their model-theoretic counterparts, Truth and consistency, The de Jongh property for basic arithmetic, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017, Automorphisms of recursively saturated models of arithmetic, Model theory of the regularity and reflection schemes, Representing Scott sets in algebraic settings, On the strength of Ramsey's theorem for pairs, Syntactical truth predicates for second order arithmetic, Deflationism, conservativeness and maximality, Fiber bundle description of number scaling in gauge theory and geometry, \(\text{NP}\not={co}\)-NP and models of arithmetic, P, NP, Co-NP and weak systems of arithmetic, Harrington's conservation theorem redone, A remark on equivalent Rosser sentences, A problem in Pythagorean arithmetic, Largest initial segments pointwise fixed by automorphisms of models of set theory, A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\), Hilbert's tenth problem for weak theories of arithmetic, Empiricism, probability, and knowledge of arithmetic: a preliminary defense, On partial disjunction properties of theories containing Peano arithmetic, Transplendent models: expansions omitting a type, Consistency, models, and soundness, Deflationary truth and pathologies, Implicit definability of subfields, Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA, Representation of left-computable \(\varepsilon \)-random reals, Independence results for variants of sharply bounded induction, A generalization of the second incompleteness theorem and some exceptions to it, R.e. Prime powers and total rigidity, AUTOMORPHISM GROUPS OF COUNTABLE ARITHMETICALLY SATURATED MODELS OF PEANO ARITHMETIC, The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X\)], A standard model of Peano arithmetic with no conservative elementary extension, Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem, Interpreting the compositional truth predicate in models of arithmetic, Possible-worlds semantics for modal notions conceived as predicates, Reverse formalism 16, Truth, disjunction, and induction, Modeling vagueness by nonstandardness, On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness, The arithmetic of cuts in models of arithmetic, Some conservation results on weak König's lemma, A new proof of Ajtai's completeness theorem for nonstandard finite structures, Cone avoidance and randomness preservation, On the consistency of the \(\Delta_1^1\)-CA fragment of Frege's Grundgesetze, On maximal subgroups of the automorphism group of a countable recursively saturated model of PA, Saturated models of universal theories, On inclusions between quantified provability logics, Formalizing a discrete model of the continuum in Coq from a discrete geometry perspective, Generalized logical consequence: Making room for induction in the logic of science, In search of the first-order part of Ramsey's theorem for pairs, A note on typed truth and consistency assertions, Sequence encoding without induction, Definability in First Order Theories of Graph Orderings, Fragments of Heyting arithmetic, Relative Truth Definability of Axiomatic Truth Theories, Varieties of Infiniteness in the Existence of Infinitely Many Primes, Kripke Models Built from Models of Arithmetic, Unnamed Item, On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos, Unnamed Item, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, Σ_{𝑛}-bounding and Δ_{𝑛}-induction, Vaught's Theorem on Axiomatizability by a Scheme, EXISTENTIALLY CLOSED MODELS IN THE FRAMEWORK OF ARITHMETIC, The metamathematics of Stable Ramsey’s Theorem for Pairs, THE NON-AXIOMATIZABILITY OF O-MINIMALITY, Arithmetical independence results using higher recursion theory, INTERPRETATIONS BETWEENω-LOGIC AND SECOND-ORDER ARITHMETIC, ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC, STRICT FINITISM, FEASIBILITY, AND THE SORITES, The two halves of disjunctive correctness, Set theory with a proper class of indiscernibles, Primitive recursive reverse mathematics, Between the Rings $${\mathbb Z}/p^n{\mathbb Z}$$ and the Ring $${\mathbb Z}_p$$: Issues of Axiomatizability, Definability and Decidability, EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES, ON COHESIVE POWERS OF LINEAR ORDERS, Nonstandard methods for finite structures, TRUTH AND FEASIBLE REDUCIBILITY, HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM, Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic, Models of Bounded Arithmetic Theories and Some Related Complexity Questions, Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic, The small‐is‐very‐small principle, NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE, Compositional truth with propositional tautologies and quantifier-free correctness, Commutative unital rings elementarily equivalent to prescribed product rings, TWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVE, Two-track depictions of Leibniz's fictions, GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETIC, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Completeness of Hoare Logic Relative to the Standard Model, A Model-Theoretic Approach to Ordinal Analysis, ILLUSORY MODELS OF PEANO ARITHMETIC, Truth without standard models: some conceptual problems reloaded, An addition to Rosser's theorem, Describing Groups, MODELS OF POSITIVE TRUTH, Generic cuts in models of arithmetic, Interstitial and pseudo gaps in models of Peano Arithmetic, WHAT CAN A CATEGORICITY THEOREM TELL US?, Where pigeonhole principles meet Koenig lemmas, A Galois correspondence for countable short recursively saturated models of PA, Minimal models of Heyting arithmetic, On the strength of Ramsey's theorem without Σ1‐induction, Random reals, the rainbow Ramsey theorem, and arithmetic conservation, The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem, Infinite finitely generated fields are biinterpretable with ℕ, MODELS OF PT– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE, MARGINALIA ON A THEOREM OF WOODIN, A note on Σ1-maximal models, THE ARITHMETIC OF THE EVEN AND THE ODD, SELF-REFERENCE IN ARITHMETIC II, Recursive models and the divisibility poset, Intuitionistic open induction and least number principle and the Buss operator, The prime number theorem is PRA-provable, Solovay's theorem cannot be simplified, Fragments of Arithmetic and true sentences, Fixpoint alternation: arithmetic, transition systems, and the binary tree, Interpretability over peano arithmetic, Bounded Scott Set Saturation, Formalizing non-standard arguments in second-order arithmetic, A note on standard systems and ultrafilters, Scott's problem for Proper Scott sets, REFERENCE IN ARITHMETIC, ANOTHER ARITHMETIC OF THE EVEN AND THE ODD, Envelopes, indicators and conservativeness, The Interpretation Existence Lemma, Extensions of the Finitist Point of View, Automorphism groups of models of Peano arithmetic, Some highly saturated models of Peano arithmetic, Definability of Recursive Predicates in the Induced Subgraph Order, A note on parameter free Π1 -induction and restricted exponentiation, GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS, An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency, ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS, Nonstandard models that are definable in models of Peano Arithmetic, A NOTE ON DERIVABILITY CONDITIONS, Σ2 Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator, Completions of PA: Models and enumerations of representable sets, THE EXPRESSIVE POWER OF TRUTH, Non-standard analysis in ACA0 and Riemann mapping theorem, DISJUNCTIONS WITH STOPPING CONDITIONS, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC, Topological models of arithmetic, Groundwork for weak analysis, An isomorphism between monoids of external embeddings: About definability in arithmetic
