When is arithmetic possible?

DOI10.1016/0168-0072(90)90053-5zbMath0711.03018OpenAlexW2010650680WikidataQ126409177 ScholiaQ126409177MaRDI QIDQ922533

Gregory Loren McColm

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90053-5

zbMATH Keywords

parametrizationexpressibilitybounded inductions

Mathematics Subject Classification ID

Inductive definability (03D70)

Related Items

How to define a linear order on finite models, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Parametrization over inductive relations of a bounded number of variables
• Upper and lower bounds for first order expressibility
• Elementary induction on abstract structures
• Classification theory and the number of non-isomorphic models
• An application of games to the completeness problem for formalized theories
• Some restrictions on simple fixed points of the integers
• A zero-one law for logic with a fixed-point operator
• Relational queries computable in polynomial time
• On Moschovakis closure ordinals
• SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
• Some applications of the notions of forcing and generic sets
• On the Computational Complexity of Algorithms