When is arithmetic possible?

DOI10.1016/0168-0072(90)90053-5zbMATH Open0711.03018OpenAlexW2010650680WikidataQ126409177 ScholiaQ126409177MaRDI QIDQ922533FDOQ922533

Authors: 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

Recommendations

• Whither relevant arithmetic?
• The (metaphysical) foundations of arithmetic?
• Arithmetic and the conditions of possible experience
• What Numbers Could Be (And, Hence, Necessarily Are)
• Arithmetic is determinate

zbMATH Keywords

parametrizationexpressibilitybounded inductions

Mathematics Subject Classification ID

Inductive definability (03D70)

Cites Work

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

Cited In (4)

• First order logic, fixed point logic and linear order
• When is scalar multiplication decidable?
• Tameness in least fixed-point logic and McColm's conjecture
• How to define a linear order on finite models

This page was built for publication: When is arithmetic possible?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922533)