The following pages link to (Q5797034):
Displaying 48 items.
- A structural/temporal query language for business processes (Q414923) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Trakhtenbrot theorem and first-order axiomatic extensions of MTL (Q897476) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- Solvable classes of pseudoprenex formulas (Q1147118) (← links)
- Characterizing Mal'cev conditions (Q1216327) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Finitely representable databases (Q1376408) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- The number of finitely axiomatizable completions (Q1814398) (← links)
- Model checking mobile ambients (Q1884885) (← links)
- Directions in generalized quantifier theory (Q1908858) (← links)
- A navigational logic for reasoning about graph properties (Q1996850) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- On first-order logic and CPDA graphs (Q2254514) (← links)
- Monotone operators on Gödel logic (Q2449851) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Elimination of quantifiers and undecidability in spatial logics for concurrency (Q2503043) (← links)
- Unabhängigkeitsbeweise in Teilsystemen der elementaren Zahlentheorie (Q2528383) (← links)
- The structure of logical probabilities (Q2541685) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- A representation independent language for planar spatial databases with Euclidean distance (Q2641864) (← links)
- Undecidability of Model Checking in Brane Logic (Q2864500) (← links)
- An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models (Q2866740) (← links)
- A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
- Approximations of Mappings (Q3295272) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- On the Almighty Wand (Q3540188) (← links)
- Decidability and Undecidability in Probability Logic (Q3605546) (← links)
- Beyond Shapes: Lists with Ordered Data (Q3617745) (← links)
- Sets of Formulas Valid in Finite Structures (Q4401428) (← links)
- (Q5015284) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- (Q5094147) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Successor-Invariant First-Order Logic on Classes of Bounded Degree (Q5145657) (← links)
- Schema Mappings: A Case of Logical Dynamics in Database Theory (Q5249666) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- Properties of graphs specified by a regular language (Q5896894) (← links)
- Properties of graphs specified by a regular language (Q5918788) (← links)
- Efficient Evaluation of Arbitrary Relational Calculus Queries (Q6137874) (← links)
- Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642) (← links)
