Saturated models of universal theories

DOI10.1016/S0168-0072(02)00030-1zbMath1015.03040MaRDI QIDQ1861531

Jeremy Avigad

Publication date: 9 March 2003

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

saturationuniversal theoriesconservation theoremsHerbrand saturated modelmodel-theoretic counterpart of Herbrand analysis

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Model-theoretic forcing (03C25) Relative consistency and interpretations (03F25)

Related Items

Algebraic proofs of cut elimination ⋮ Preservation theorems for bounded formulas ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ Local induction and provably total computable functions ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ A simple proof of Parsons' theorem ⋮ Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA ⋮ Forcing in Proof Theory ⋮ Polynomial time ultrapowers and the consistency of circuit lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional interpretations of feasibly constructive arithmetic
• Fragments of arithmetic
• Two applications of Boolean models
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Constructivism in mathematics. An introduction. Volume I
• Handbook of proof theory
• A proof-theoretic analysis of collection
• Algebraic proofs of cut elimination
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• Transfer principles in nonstandard intuitionistic arithmetic
• Remarks on Herbrand normal forms and Herbrand realizations
• Explicit algebraic models for constructive and classical theories with non-standard elements
• Formalizing forcing arguments in subsystems of second-order arithmetic
• Herbrand analyses
• Interpreting classical theories in constructive ones
• A Model-Theoretic Approach to Ordinal Analysis
• An application of constructive completeness
• A new method for establishing conservativity of classical systems over their intuitionistic version
• Notes on polynomially bounded arithmetic