Finite-model theory -- A personal perspective
From MaRDI portal
(Redirected from Publication:688663)
Recommendations
Cites work
- scientific article; zbMATH DE number 3122413 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 4106276 (Why is no real title available?)
- scientific article; zbMATH DE number 3657754 (Why is no real title available?)
- scientific article; zbMATH DE number 3715502 (Why is no real title available?)
- scientific article; zbMATH DE number 8117 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 3530978 (Why is no real title available?)
- scientific article; zbMATH DE number 3550205 (Why is no real title available?)
- scientific article; zbMATH DE number 3562523 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3600018 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4001521 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- scientific article; zbMATH DE number 3093421 (Why is no real title available?)
- 0-1 laws and decision problems for fragments of second-order logic
- A Deductive System for Existential Least Fixpoint Logic
- A counterexample to a conjecture of Scott and Suppes
- A logical approach to asymptotic combinatorics I. First order properties
- A spectrum hierarchy
- A two‐cardinal characterization of double spectra
- A zero-one law for logic with a fixed-point operator
- Almost sure theories
- An application of games to the completeness problem for formalized theories
- Asymmetric graphs
- Classification theory and the number of non-isomorphic models
- Complexity of the first-order theory of almost all finite structures
- Concerning measures in first order calculi
- Course of mathematical logic. Vol. 1: Relation and logical formula. Translation edited by David Louvish
- Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
- Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
- Fixed-point extensions of first-order logic
- Homogeneous Universal Relational Systems.
- Horn clauses and database dependencies
- Languages that Capture Complexity Classes
- Model theory.
- Monadic generalized spectra
- Monotone versus positive
- Nonconvergence, undecidability, and intractability in asymptotic problems
- Nondeterministic Space is Closed under Complementation
- Number of quantifiers is better than number of tape cells
- On monadic NP vs monadic co-NP
- On random models of finite power and monadic logic
- On the definability of properties of finite graphs
- Paths, Trees, and Flowers
- Probabilities of First-Order Sentences about Unary Functions
- Probabilities on finite models
- Reachability is harder for directed than for undirected finite graphs
- Relational queries computable in polynomial time
- Relationships between nondeterministic and deterministic tape complexities
- Relative complexity of checking and evaluating
- Relativizing Time, Space, and Time-Space
- Sentences true in all constructive models
- Some simplified NP-complete graph problems
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Structure and complexity of relational queries
- The Gödel class with identity is unsolvable
- The complexity of theorem-proving procedures
- The decision problem for standard classes
- The method of forced enumeration for nondeterministic automata
- Turing machines and the spectra of first-order formulas
- Universal graphs and universal functions
- Upper and lower bounds for first order expressibility
- Zero-One Laws for Sparse Random Graphs
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(40)- Locally finite languages
- Expressivity and Complexity of Dependence Logic
- Existential second-order logic and modal logic with quantified accessibility relations
- 0-1 laws by preservation
- scientific article; zbMATH DE number 176207 (Why is no real title available?)
- scientific article; zbMATH DE number 7701441 (Why is no real title available?)
- Elements of finite model theory.
- Probabilities in first—order logic of a unary function and a binary relation
- A technique for proving decidability of containment and equivalence of linear constraint queries
- scientific article; zbMATH DE number 5852773 (Why is no real title available?)
- Some connections between finite and infinite model theory
- Verifiable properties of database transactions
- Query languages for bags and aggregate functions
- Finitely representable databases
- A probabilistic view of Datalog parallelization
- Queries with arithmetical constraints
- Descriptive complexity of finite structures: Saving the quantifier rank
- A general condition for collapse results
- Günter Asser (1926–2015)
- A logical approach to locality in pictures languages
- Asymptotic invariants, complexity of groups and related problems.
- Almost everywhere elimination of probability quantifiers
- Finite Model Theory on Tame Classes of Structures
- Computability by monadic second-order logic
- Closure properties of locally finite \(\omega\)-languages
- scientific article; zbMATH DE number 219195 (Why is no real title available?)
- Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
- A decidable class of nested iterated schemata
- The complexity of reasoning with FODD and GFODD
- Lattice of algebraically closed sets in one-based theories
- Metafinite model theory
- Logic, semigroups and automata on words
- First-order spectra with one binary predicate
- Finite and infinite model theory - a historical perspective
- On the variable hierarchy of first-order spectra
- Subtournaments isomorphic to W₅ in a indecomposable tournament
- Finite model theory
- A query language for NC
- Computing with infinitary logic
- On the expressive power of counting
This page was built for publication: Finite-model theory -- A personal perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688663)
