Generalizing classical and effective model theory in theories of operations and classes
From MaRDI portal
Publication:810008
DOI10.1016/0168-0072(91)90032-HzbMath0733.03030OpenAlexW2033882622MaRDI QIDQ810008
Publication date: 1991
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(91)90032-h
countable model theoryhyperarithmetical model theoryL(Q)-completenessrecursive model theorytheories of operations and classes
Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15) Logic on admissible sets (03C70) Abstract model theory (03C95)
Related Items (1)
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
- Set existence axioms for general (not necessarily countable) stability theory
- Intensionality in mathematics
- Countable algebra and set existence axioms
- Recursive categoricity and recursive stability
- Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Decidable models
- Model theory
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Undecidable theories
- Stability theory and set existence axioms
- Foundations of recursive model theory
- Model theory on admissible sets
- Recursively presentable prime models
- An introduction to recursively saturated and resplendent models
- Toward model theory through recursive saturation
- LA(Ⅎ)
- Logic with the quantifier “there exist uncountably many”
This page was built for publication: Generalizing classical and effective model theory in theories of operations and classes