The following pages link to (Q4146722):
Displaying 50 items.
- Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience (Q386630) (← links)
- Arbitrary sequence RAMs (Q477622) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- \(\Sigma^ n_ 0\)-equivalence relations (Q793716) (← links)
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games) (Q805613) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Counterexamples to countable-section \(\varPi_2^1\) uniformization and \(\varPi_3^1\) separation (Q904147) (← links)
- Non-recursiveness of the operations on real numbers (Q909437) (← links)
- A Suppes predicate for general relativity and set-theoretically generic spacetimes (Q918975) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- Members of countable \(\Pi ^ 0_ 1\) classes (Q1084100) (← links)
- The realm of primitive recursion (Q1112020) (← links)
- Monotone inductive definitions in a constructive theory of functions and classes (Q1115865) (← links)
- The Galvin-Prikry theorem and set existence axioms (Q1117221) (← links)
- An improved zero-one law for algorithmically random sequences (Q1127324) (← links)
- Inductive definability: Measure and category (Q1155049) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- Measure theoretic approach to the classification of cellular automata (Q1201100) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Applications of cut-free infinitary derivations to generalized recursion theory (Q1295406) (← links)
- Game-theoretic inductive definability (Q1314543) (← links)
- Identifying randomness given by high descriptive complexity (Q1325197) (← links)
- Proof theory of reflection (Q1332853) (← links)
- The complexity of revision (Q1333309) (← links)
- The polynomially exponential time restrained analytical hierarchy (Q1337640) (← links)
- Power set recursion (Q1346246) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- A completeness theorem for the expressive power of higher-order algebraic specifications (Q1362341) (← links)
- Uncomputability: The problem of induction internalized (Q1434378) (← links)
- The descriptive complexity of Brownian motion (Q1590058) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Transplendent models: expansions omitting a type (Q1762364) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers) (Q1825868) (← links)
- Universes over Frege structures (Q1861539) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- Levels of truth (Q1903585) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
