Pages that link to "Item:Q4096938"
From MaRDI portal
The following pages link to Recursively presentable prime models (Q4096938):
Displaying 36 items.
- Computing constraint sets for differential fields (Q402682) (← links)
- Independence in computable algebra (Q497725) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one (Q779152) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- On two problems of Turing complexity for strongly minimal theories (Q954212) (← links)
- Turing machine computations in finitely axiomatizable theories (Q1059628) (← links)
- Connection between constructivizibility and strong constructivizibility for different classes of Abelian groups (Q1075317) (← links)
- Criterion for strong constructivizability of a homogeneous model (Q1140632) (← links)
- Strong constructivizability of homogeneous models (Q1142774) (← links)
- A totally transcendental decidable theory without constructivizable homogeneous models (Q1156128) (← links)
- The model theory of differential fields revisited (Q1233436) (← links)
- Decidable models (Q1239318) (← links)
- Computable models of theories with few models (Q1381432) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- A note on decidable categoricity and index sets (Q2200982) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- An uncountably categorical theory whose only computably presentable model is saturated (Q2505131) (← links)
- Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
- The degrees of categorical theories with recursive models (Q2839320) (← links)
- RELATIVE TO ANY NON-HYPERARITHMETIC SET (Q2853977) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- Adapting Rabin’s Theorem for Differential Fields (Q3091458) (← links)
- Computable trees, prime models, and relative decidability (Q3372136) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- Type Structure Complexity and Decidability (Q3955339) (← links)
- A geometric model of an arbitrary differentially closed field of characteristic zero (Q5141765) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- On Decidable and Computable Models of Theories (Q5326370) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy (Q5400808) (← links)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- Computably and punctually universal spaces (Q6614035) (← links)
