scientific article; zbMATH DE number 612169
From MaRDI portal
Publication:4298571
Cited in
(96)- Classifying regular languages by a split game
- Logics of relative identity
- On the desirability of mechanizing calculational proofs
- Generalized logical consequence: Making room for induction in the logic of science
- Formalization of the resolution calculus for first-order logic
- Second-order propositional modal logic: expressiveness and completeness results
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Some results concerning simple locally finite groups of 1-type.
- Adding for-loops to first-order logic
- Learning elementary formal systems with queries.
- Refuting learning revisited.
- Describing parameterized complexity classes
- On the complexity of decision using destinies in \(H\)-bounded structures
- The complexity of first-order and monadic second-order logic revisited
- Modal and guarded characterisation theorems over finite transition systems
- Computing crossing numbers in quadratic time
- A double arity hierarchy theorem for transitive closure logic
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Universally defining finitely generated subrings of global fields
- A logic-based approach to incremental reasoning on multi-agent systems
- Tableaux for free logics with descriptions
- Deciding quantifier-free definability in finite algebraic structures
- On the parameterized complexity of \([1,j]\)-domination problems
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- On the existence of free models in fuzzy universal Horn classes
- Polynomial hierarchy graph properties in hybrid logic
- Arity hierarchies
- Existential second-order logic and modal logic with quantified accessibility relations
- Bounded quantifier depth spectra for random graphs
- Generalizing empirical adequacy. II: Partial structures
- A note on the size of prenex normal forms
- On bracketing names and quantifiers in first-order logic
- The probability nesting game
- An infinitary system for the least fixed-point logic restricted to finite models
- Logics of finite Hankel rank
- Incompleteness theorems, large cardinals, and automata over finite words
- On the zero-one k-law extensions
- Changing a Semantics: Opportunism or Courage?
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- On the logic of theory change: Partial meet contraction and revision functions
- A representation theorem for (q-)holonomic sequences
- Zero-one \(k\)-law
- A decidability result for the model checking of infinite-state systems
- scientific article; zbMATH DE number 1968554 (Why is no real title available?)
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Foundations and philosophy of mathematics in Warsaw, the school of Andrzej Mostowski and philosophy
- Achieving new upper bounds for the hypergraph duality problem through logic
- Second-order propositional modal logic and monadic alternation hierarchies
- Commentary and illocutionary expressions in linear calculi of natural deduction
- Is universal computation a myth?
- The epistemology of computer-mediated proofs
- Probabilistic Modeling of Default Reasoning
- The sound and complete R-calculus for revising propositional theories
- On the Parameterized Complexity of [1,j]-Domination Problems
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
- Spectra and satisfiability for logics with successor and a unary function
- Proof verification and proof discovery for relativity
- Logic and Game Theory
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus
- Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
- Scientific discovery on positive data via belief revision
- The descriptive complexity approach to LOGCFL
- Boolean products of real closed valuation rings and fields
- Games and Lindström theorems
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- Parameterised counting in logspace
- \textsf{LOGIC}: a Coq library for logics
- Universally defining Z$\mathbb {Z}$ in Q$\mathbb {Q}$ with 10 quantifiers
- Formal Reasoning About Influence in Natural Sciences Experiments
- Count-free Weisfeiler-Leman and group isomorphism
- Recursive definitions and fixed-points on well-founded structures
- A logico-geometric comparison of coherence for non-additive uncertainty measures
- Monadic partition logics and finite automata
- When Iota meets lambda
- Equational theories and validity for logically constrained term rewriting
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- Sequential merging and construction of rankings as cognitive logic
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Stable canonical rules for intuitionistic modal logics
- Parameterised counting in logspace
- The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
- Advances in algorithmic meta theorems (invited paper)
- Parallel complexity of identifying groups and quasigroups via decompositions
- Modal characterisation theorems over special classes of frames
- Nominal equational narrowing: rewriting for unification in languages with binders
- The epsilon calculus and Herbrand complexity
- Trees, grids, and MSO decidability: from graphs to matroids
- Concise finite-domain representations for PDDL planning tasks
- Complexity of counting the optimal solutions
- Simplifying proofs in Fitch-style natural deduction systems
- A first order theory of functional parthood
- A logical expression of reasoning
- Are there any good digraph width measures?
- Fine hierarchies and m-reducibilities in theoretical computer science
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4298571)
