Pages that link to "Item:Q1090327"
From MaRDI portal
The following pages link to Fixed-point extensions of first-order logic (Q1090327):
Displaying 50 items.
- On inflationary fix-point operators safety (Q266210) (← links)
- On the expressive power of counting (Q672336) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- Inductive situation calculus (Q1028914) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- An analysis of fixed-point queries on binary trees (Q1183571) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Inferring null join dependencies in relational databases (Q1198969) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- The nested universal relation data model (Q1342865) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- Metafinite model theory (Q1383163) (← links)
- Bounded fixpoints for complex objects (Q1392283) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- An algebra for pomsets. (Q1854275) (← links)
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra (Q1854400) (← links)
- Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Partial fixed point for finite models in second order logic (Q2211373) (← links)
- Database querying under changing preferences (Q2385451) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Arity hierarchies (Q2563982) (← links)
- In the random graph \(G(n,p), p=n^{-a}\): If \(\psi\) has probability \(O(n^{-\varepsilon})\) for every \(\varepsilon >0\) then it has probability \(O(e^{-n^ \varepsilon})\) for some \(\varepsilon >0\) (Q2564048) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- Program completion in the input language of GRINGO (Q4592711) (← links)
- Computing on structures (Q4630296) (← links)
- Complete problems for fixed-point logics (Q4842629) (← links)
- Tailoring recursion for complexity (Q4858828) (← links)
- The expressive power of fixed-point logic with counting (Q4879905) (← links)
- Logic and Game Theory (Q5249678) (← links)
