The following pages link to Fields of Logic and Computation (Q3585994):
Displaying 30 items.
- Yuri, Logic, and Computer Science (Q3585995) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- Tracking Evidence (Q3585997) (← links)
- Strict Canonical Constructive Systems (Q3585998) (← links)
- Existential Fixed-Point Logic, Universal Quantifiers, and Topoi (Q3585999) (← links)
- Three Paths to Effectiveness (Q3586000) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- Normalization of Some Extended Abstract State Machines (Q3586002) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- A Logic for PTIME and a Parameterized Halting Problem (Q3586007) (← links)
- Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic (Q3586011) (← links)
- Abstract State Machines and the Inquiry Process (Q3586012) (← links)
- The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion (Q3586013) (← links)
- Definability of Combinatorial Functions and Their Linear Recurrence Relations (Q3586014) (← links)
- Halting and Equivalence of Program Schemes in Models of Arbitrary Theories (Q3586015) (← links)
- Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics (Q3586016) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- DKAL and Z3: A Logic Embedding Experiment (Q3586018) (← links)
- Decidability of the Class E by Maslov’s Inverse Method (Q3586019) (← links)
- Logics for Two Fragments beyond the Syllogistic Boundary (Q3586020) (← links)
- Choiceless Computation and Symmetry (Q3586021) (← links)
- Hereditary Zero-One Laws for Graphs (Q3586023) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- Decidable Expansions of Labelled Linear Orderings (Q5892516) (← links)
