Fixed-point extensions of first-order logic
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 824731
- scientific article; zbMATH DE number 4180775
- Fixed Point Logics
- Extended First-Order Logic
- Fixed-point logics and computation
- scientific article; zbMATH DE number 3903941
- Publication:3204446
- Extended Lambek calculi and first-order linear logic
- Axiomatizing fixpoint logics
- Fixed-point logics, generalized quantifiers, and oracles
Cites work
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 3731388 (Why is no real title available?)
- scientific article; zbMATH DE number 3602653 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- scientific article; zbMATH DE number 3378527 (Why is no real title available?)
- scientific article; zbMATH DE number 3397511 (Why is no real title available?)
- scientific article; zbMATH DE number 3188506 (Why is no real title available?)
- A zero-one law for logic with a fixed-point operator
- Elementary induction on abstract structures
- Model theory
- Monotone versus positive
- On monotone vs. nonmonotone induction
- On nonmonotone inductive definability
- Properties preserved in subdirect products
- The complexity of explicit definitions
Cited in
(91)- The expressive power of stratified logic programs
- Partial fixed point for finite models in second order logic
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
- 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\)
- scientific article; zbMATH DE number 1795986 (Why is no real title available?)
- On inflationary fix-point operators safety
- Metafinite model theory
- Feferman-vaught decompositions for prefix classes of first order logic
- Recursive definitions and fixed-points
- Why not negation by fixpoint?
- Infinitary logics and 0-1 laws
- Logic and Game Theory
- The alternating fixpoint of logic programs with negation
- One Useful Logic That Defines Its Own Truth
- scientific article; zbMATH DE number 1841826 (Why is no real title available?)
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- A restricted second order logic for finite structures
- Finite-model theory -- A personal perspective
- Fixed-point logics and computation
- Complete problems for fixed-point logics
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Using automata theory for characterizing the semantics of terminological cycles
- Enhancing fixed point logic with cardinality quantifiers
- Semantics and expressive power of nondeterministic constructs in deductive databases
- Minimal predicates, fixed-points, and definability
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 7267155 (Why is no real title available?)
- Symbioses between mathematical logic and computer science
- Circumscribing DATALOG: expressive power and complexity
- scientific article; zbMATH DE number 6680142 (Why is no real title available?)
- scientific article; zbMATH DE number 824731 (Why is no real title available?)
- Tailoring recursion for complexity
- Graph games and logic design
- \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
- Generalized quantifiers and pebble games on finite structures
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Complexity and undecidability results for logic programming
- Idealization in applied first-order logic
- Hereditarily-finite sets, data bases and polynomial-time computability
- Automata, Languages and Programming
- Compositionality in context
- Context-sensitive transitive closure operators
- NP-completeness by first-order and quantifier-free interpretations and related topics
- Inductive definitions over finite structures
- A restricted second order logic for finite structures
- On fixed-point logic with counting
- Capturing complexity classes by fragments of second-order logic
- Logical characterizations of weighted complexity classes
- The expressive power of fixed-point logic with counting
- Inductive situation calculus
- Querying datalog programs with temporal logic
- An extension of first order limit language
- Fixed Point Logics
- Fixed-point Logics with Nondeterministic Choice
- Canonisation and Definability for Graphs of Bounded Rank Width
- scientific article; zbMATH DE number 1354137 (Why is no real title available?)
- On undecidability of unary nonnested PFP operators for one successor function theory
- Metafinite model theory
- An analysis of fixed-point queries on binary trees
- Database querying under changing preferences
- An expansion of first-order Belnap-Dunn logic
- The nested universal relation data model
- Expressive equivalence of least and inflationary fixed-point logic
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- scientific article; zbMATH DE number 3903941 (Why is no real title available?)
- An algebra for pomsets.
- Program completion in the input language of GRINGO
- Arity hierarchies
- Some Turing-complete extensions of first-order logic
- A logic of fixpoint definitions
- Inferring null join dependencies in relational databases
- How to define a linear order on finite models
- Computing on structures
- Recursive definitions and fixed-points on well-founded structures
- Descriptive complexity and weighted Turing machines
- Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3
- Semantic restrictions over second-order logic
- Continuous first order logic and local stability
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- An expansion of basic logic with fixed points
- Inflationary fixed points in modal logic
- Finite Variable Logics in Descriptive Complexity Theory
- Logics capturing relativized complexity classes uniformly
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- Descriptive complexity of deterministic polylogarithmic time and space
- Bounded fixpoints for complex objects
- What is an algorithm?
- A Fixpoint Semantics for Ordered Logic
- On the expressive power of counting
This page was built for publication: Fixed-point extensions of first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090327)
