The following pages link to Recursive Pseudo-Well-Orderings (Q5579489):
Displaying 38 items.
- Initial segments of computable linear orders with additional computable predicates (Q431706) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- Surrealist landscape with figures (a survey of recent results in set theory) (Q754865) (← links)
- The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)
- Categoricity of computable infinitary theories (Q1005932) (← links)
- Scott ranks of models of a theory (Q1644961) (← links)
- Complete groups are complete co-analytic (Q1661678) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- Ungroundedness in Tarskian languages (Q2000676) (← links)
- On the isomorphism problem for some classes of computable algebraic structures (Q2155501) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Degrees of autostability relative to strong constructivizations for Boolean algebras (Q2364293) (← links)
- The countable admissible ordinal equivalence relation (Q2400501) (← links)
- Degree-invariant, analytic equivalence relations without perfectly many classes (Q2832838) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- Model Theoretic Complexity of Automatic Structures (Extended Abstract) (Q3502675) (← links)
- On the Π<sub>1</sub> <sup>1</sup> -separation principle (Q3545211) (← links)
- Minimal Covers and Hyperdegrees (Q4075452) (← links)
- There is no classification of the decidably presentable structures (Q4562439) (← links)
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR (Q4628679) (← links)
- Some new computable structures of high rank (Q4636764) (← links)
- Embedding jump upper semilattices into the Turing degrees (Q4650267) (← links)
- A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations (Q4683538) (← links)
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES (Q5021936) (← links)
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH (Q5107225) (← links)
- Incompleteness and jump hierarchies (Q5119250) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS (Q5159502) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- MINIMUM MODELS OF SECOND-ORDER SET THEORIES (Q5222524) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- Isomorphism relations on computable structures (Q5388722) (← links)
- A Property of Arithmetic Sets (Q5663849) (← links)
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (Q5855748) (← links)
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES (Q6180600) (← links)
