Models of arithmetic and recursive functions
From MaRDI portal
Publication:1219274
DOI10.1007/BF02757881zbMath0311.02050OpenAlexW1995881727MaRDI QIDQ1219274
Publication date: 1975
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02757881
Applications of computability and recursion theory (03D80) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other classical first-order model theory (03C68)
Related Items (17)
Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ Embeddings of and into Nerode semirings ⋮ Torre models in the isols ⋮ \(\Delta_{1}\) ultrapowers are totally rigid ⋮ ON COHESIVE POWERS OF LINEAR ORDERS ⋮ A remark on pseudo proof systems and hard instances of the satisfiability problem ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ On the Minimality of Tame Models in the Isols ⋮ Eight problems about Nerode semirings (recursive ultrapowers) ⋮ On co-simple isols and their intersection types ⋮ Some observations on the substructure lattice of a Δ1 ultrapower ⋮ Realizability interpretation of PA by iterated limiting PCA ⋮ Sub-arithmetical ultrapowers: A survey ⋮ Combinatorial Isols and the Arithmetic of Dekker Semirings ⋮ R.e. Prime powers and total rigidity ⋮ Recursive Fibers of RST Isols ⋮ Polynomial time ultrapowers and the consistency of circuit lower bounds
Cites Work
This page was built for publication: Models of arithmetic and recursive functions