The following pages link to (Q4249355):
Displaying 30 items.
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- Conditional terms in semantic programming (Q1694705) (← links)
- On constructive number fields and computability of solutions of PDEs (Q1707150) (← links)
- Recursive terms in semantic programming (Q1731392) (← links)
- Effective completeness theorems for modal logic (Q1877094) (← links)
- Finitely presented expansions of computably enumerable semigroups (Q1936272) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- A meaning based information theory - informalogical space: basic concepts and convergence of information sequences (Q2269790) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- Degree spectra of intrinsically c.e. relations (Q2747697) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Spectra of structures and relations (Q3426577) (← links)
- Classification from a Computable Viewpoint (Q3430937) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Computably categorical structures and expansions by constants (Q4254616) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- A computably categorical structure whose expansion by a constant has infinite computable dimension (Q4650279) (← links)
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 (Q4678940) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
- Limitwise monotonic functions, sets, and degrees on computable domains (Q5190192) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY (Q5251361) (← links)
- Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation (Q5477636) (← links)
- Up to equimorphism, hyperarithmetic is recursive (Q5718664) (← links)
- ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS (Q5737950) (← links)
- Effective metric model theory (Q5740682) (← links)
- 2005–06 Winter Meeting of the Association for Symbolic Logic (Q5754719) (← links)
