The following pages link to Decidable models (Q1239318):
Displaying 22 items.
- Autostability of prime models under strong constructivizations (Q431714) (← links)
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals (Q498238) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Criterion for strong constructivizability of a homogeneous model (Q1140632) (← links)
- Strong constructivizability of homogeneous models (Q1142774) (← links)
- A theory with two strongly constructivizable models (Q1146664) (← links)
- Computable models of theories with few models (Q1381432) (← links)
- A note on decidable categoricity and index sets (Q2200982) (← links)
- Turing degrees of complete formulas of almost prime models (Q2300743) (← links)
- \(\mathsf{WKL}_0\) and induction principles in model theory (Q2344719) (← links)
- Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
- Degrees of Recursively Saturated Models (Q3222194) (← links)
- A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic (Q3570169) (← links)
- The degree spectra of homogeneous models (Q3617376) (← links)
- Theories with recursive models (Q3856753) (← links)
- IN MEMORIAM: MICHAEL MORLEY, 1930–2020 (Q5037524) (← links)
- On Decidable and Computable Models of Theories (Q5326370) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types (Q6187997) (← links)
- Computable Boolean algebras and complexity of the Fréchet ideal (Q6634567) (← links)
