scientific article; zbMATH DE number 3057871
From MaRDI portal
zbMath0038.15001MaRDI QIDQ5797034
Publication date: 1950
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Logical Approach to Data-Aware Automated Sequence Generation, Model checking mobile ambients, Trakhtenbrot’s Theorem in Coq, Inductive definitions over finite structures, The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, A representation independent language for planar spatial databases with Euclidean distance, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Directions in generalized quantifier theory, Finitely representable databases, The theory of the \(\alpha \) degrees is undecidable, Queries with arithmetical constraints, Trakhtenbrot theorem and first-order axiomatic extensions of MTL, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, A structural/temporal query language for business processes, Efficient Evaluation of Arbitrary Relational Calculus Queries, Solvable classes of pseudoprenex formulas, Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version, Unnamed Item, A uniform method for proving lower bounds on the computational complexity of logical theories, 0-1 laws and decision problems for fragments of second-order logic, Monotone operators on Gödel logic, On the Almighty Wand, Approximations of Mappings, Successor-Invariant First-Order Logic on Classes of Bounded Degree, Decomposable graphs and definitions with no quantifier alternation, Properties of graphs specified by a regular language, Conjunctive query containment with respect to views and constraints, A navigational logic for reasoning about graph properties, Finite-model theory -- A personal perspective, On first-order logic and CPDA graphs, Properties of graphs specified by a regular language, Characterizing Mal'cev conditions, Elimination of quantifiers and undecidability in spatial logics for concurrency, Unnamed Item, Decidability and Undecidability in Probability Logic, From Logic to Theoretical Computer Science – An Update, Beyond Shapes: Lists with Ordered Data, A technique for proving decidability of containment and equivalence of linear constraint queries, Unabhängigkeitsbeweise in Teilsystemen der elementaren Zahlentheorie, The number of finitely axiomatizable completions, The structure of logical probabilities, Decidable fragments of many-sorted logic, Schema Mappings: A Case of Logical Dynamics in Database Theory, Undecidability of Model Checking in Brane Logic, Formalization of the computational theory of a Turing complete functional language model, Hereditarily-finite sets, data bases and polynomial-time computability, An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models, Sets of Formulas Valid in Finite Structures
