scientific article
From MaRDI portal
Publication:3230355
zbMath0068.24302MaRDI QIDQ3230355
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (56)
Ramsey properties for classes of relational systems ⋮ GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC ⋮ Structure and Power: an Emerging Landscape ⋮ One unary function says less than two in existential second order logic ⋮ Generalized hex and logical characterizations of polynomial space ⋮ Succinct definitions in the first order theory of graphs ⋮ Hanf numbers for extendibility and related phenomena ⋮ Counting quantifiers, successor relations, and logarithmic space ⋮ Invariance under stuttering in a temporal logic of actions ⋮ Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures ⋮ An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ On winning Ehrenfeucht games and monadic NP ⋮ Universal decomposed Banach spaces ⋮ Isometric uniqueness of a complementably universal Banach space for Schauder decompositions ⋮ Automatic models of first order theories ⋮ Solutions and query rewriting in data exchange ⋮ The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture ⋮ An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers ⋮ Metrically universal abelian groups ⋮ Strongly minimal Steiner systems. II: Coordinatization and quasigroups ⋮ Comparing the power of monadic NP games ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Arboreal categories and equi-resource homomorphism preservation theorems ⋮ Countable infinite existentially closed models of universally axiomatizable theories ⋮ First-order logic axiomatization of metric graph theory ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ Computing branching distances with quantitative games ⋮ A group-theoretical invariant for elementary equivalence and its role in representations of elementary classes ⋮ The quantitative linear-time-branching-time spectrum ⋮ Forcing formulas in Fraïssé structures and classes ⋮ The primal framework. II: Smoothness ⋮ Decomposable graphs and definitions with no quantifier alternation ⋮ Computational complexity of determining which statements about causality hold in different space-time models ⋮ Graph Connectivity, Monadic NP and built-in relations of moderate degree ⋮ Infinitary logics and 0-1 laws ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Properties of existentially closed companions ⋮ A Practical Approach to Courcelle's Theorem ⋮ Inherent complexity of recursive queries ⋮ An undecidable linear order that is \(n\)-decidable for all \(n\) ⋮ Finite information logic ⋮ The universal Banach space with a $K$-suppression unconditional basis ⋮ Unnamed Item ⋮ On winning strategies in Ehrenfeucht-Fraïssé games ⋮ Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes ⋮ Local properties of query languages ⋮ The probability nesting game ⋮ The closure of monadic NP ⋮ Cohen-like first order structures ⋮ The first order definability of graphs with separators via the Ehrenfeucht game ⋮ Logic and Game Theory ⋮ Unnamed Item ⋮ An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic ⋮ An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models ⋮ Unnamed Item
This page was built for publication:
