The first order properties of products of algebraic systems
From MaRDI portal
Publication:3261418
DOI10.4064/fm-47-1-57-103zbMath0088.24803OpenAlexW1511526676MaRDI QIDQ3261418
Publication date: 1959
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213526
Related Items
Decidability of Definability Issues in the Theory of Real Addition, Corps équivalents à leur corps de séries, Unnamed Item, Between reduced powers and ultrapowers, II., A Fortuitous Year with Leon Henkin, Generalized finite automata theory with an application to a decision problem of second-order logic, Unnamed Item, Decision methods in the theory of ordinals, Sheaf Constructions and Their Elementary Properties, The Theory of Ordered Abelian Groups does not have the Independence Property, Recursion Schemes and the WMSO+U Logic, Logics of Finite Hankel Rank, Between reduced powers and ultrapowers, Sheaves of structures, Heyting‐valued structures, and a generalization of Łoś's theorem, Feferman-vaught decompositions for prefix classes of first order logic, An Almost Everywhere Direct Power, Sharp Vaught's conjecture for some classes of partial orders, Commutative unital rings elementarily equivalent to prescribed product rings, Complexity of the problem of being equivalent to Horn formulas. II, Decidability of the class of all the rings : A problem of Ax, Unnamed Item, IN MEMORIAM: SOLOMON FEFERMAN (1928–2016), On algebraic array theories, Weakly maximal decidable structures, INTERLEAVING LOGIC AND COUNTING, Unnamed Item, Reduced Products and Horn Classes, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Tarski’s Influence on Computer Science, Foundations and Philosophy of Mathematics in Warsaw, the School of Andrzej Mostowski and Philosophy, Andrzej Mostowski and the Notion of a Model, On products of relational structures, Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars, A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic., Unnamed Item, Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory, Regular Languages of Words over Countable Linear Orderings, Elementary properties of the Boolean hull and reduced quotient functors, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, A Practical Approach to Courcelle's Theorem, Decidability of Circumscribed Description Logics Revisited, Unnamed Item, Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees, Boolean products of real closed valuation rings and fields, Some model-theoretic results in the algebraic theory of quadratic forms, Compositional Failure Detection in Structured Transition Systems, AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS, Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey, Decision Procedures for Multisets with Cardinality Constraints, Unnamed Item, The Complexity of Decomposing Modal and First-Order Theories, Sets with Cardinality Constraints in Satisfiability Modulo Theories, Unnamed Item, Representations of MV-algebras by sheaves, Decidable Discriminator Varieties from Unary Classes, From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory, Model theory of 𝐶*-algebras, Where First-Order and Monadic Second-Order Logic Coincide, Model Checking Parameterised Multi-token Systems via the Composition Method, The Compositional Method and Regular Reachability, Decidable Extensions of Church’s Problem, Combining Theories with Shared Set Operations, Generalized Quantifiers and Compact Logic, Topological model theory with an interior operator: Consistency properties and back — and forth arguments, Turning decision procedures into disprovers, Definable Sets in Ordered Structures. I, APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES, Reduced products, Horn sentences, and decision problems, Generalized finite automata theory with an application to a decision problem of second-order logic, Nice infinitary logics, Homogeneous limit reduced powers, Trees, grids, and MSO decidability: from graphs to matroids, The model theory of unitriangular groups, Elementary and algebraic properties of the Arens-Kaplansky constructions, Recursive categoricity and recursive stability, On the logic of event-causation. Jaśkowski-style systems of causal logic, On decidability of monadic logic of order over the naturals extended by monadic predicates, Hyperfinite MV-algebras, Model-theoretic imaginaries and coherent sheaves, First order theory of cyclically ordered groups, Zur Modelltheorie von Kranzprodukten. (On the model theory of wreath products), NP satisfiability for arrays as powers, Decidable representations, Vertex-minors, monadic second-order logic, and a conjecture by Seese, Produits lexicographiques de groupes ordonnés: Isomorphisme et équivalence élémentaire. (Lexicographic products of ordered groups: isomorphism and elementary equivalence), Deciding Boolean algebra with Presburger arithmetic, MV-algebras and partially cyclically ordered groups, Cancellation and absorption of lexicographic powers of totally ordered Abelian groups, Dominoes and the complexity of subclasses of logical theories, Counting models in universal Horn classes, Algorithmic uses of the Feferman-Vaught theorem, Ehrenfeucht games and ordinal addition, Direct product decompositions of structures and theories, Decidable theories of non-projectable \(l\)-groups of continuous functions, Coding in the partial order of enumerable sets, MSOL partitioning problems on graphs of bounded treewidth and clique-width, On \(\aleph_0\)-categoricity of filtered Boolean extensions, Some supplements to Feferman-Vaught related to the model theory of adeles, Solving quantified linear arithmetic by counterexample-guided instantiation, Direct products and elementary equivalence of polycyclic-by-finite groups., Logic-based ontology comparison and module extraction, with an application to DL-Lite, Courcelle's theorem -- a game-theoretic approach, Counting on CTL\(^*\): On the expressive power of monadic path logic, First-order theories of subgroups of divisible Hahn products, Model-checking hierarchical structures, Temporal logics over linear time domains are in PSPACE, Continuous time temporal logic with counting, The periodic power of \(\mathcal A\) and complete Horn theories, Lattices of equational theories of models, Elementary properties of free extensions, Decision procedures for term algebras with integer constraints, Selection over classes of ordinals expanded by monadic predicates, \(P\)-combinations of ordered theories, The completeness of Peano multiplication, Preservation properties for products and sums of metric structures, A uniform method for proving lower bounds on the computational complexity of logical theories, On direct products of automaton decidable theories, On systems of equations over free products of groups., Practical algorithms for MSO model-checking on tree-decomposable graphs, Elimination of unbounded quantifiers for some poly-regular groups of infinite rank, Exact complexity bounds for ordinal addition, Elementary equivalence of some rings of definable functions, Model-completions for abelian lattice-ordered groups with finitely many disjoint elements, Arity hierarchy for temporal logics, Recursive properties of relations on models, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Mal'cev's correspondence and unsolvability, Algebras for definable families of theories, Compactness and normality in abstract logics, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Coherence of polynomial rings and bounds in polynomial ideals, \(\Sigma\)-free models, Theories of linear order, On generalized products preserving compactness, On Horn theories, Primality and model-completions, Multitree automata that count, Algebraic geometry over groups. III: Elements of model theory., Filtered and stable Boolean powers are relativized full Boolean powers, Lattice-theoretic decision problems in universal algebra, Rings with \(\aleph_1\)-categorical theories, Boolean powers, The complete finitely axiomatized theories of order are dense, Solubility of theories in a certain calculus, An expressively complete linear time temporal logic for Mazurkiewicz traces, Elementary properties of V-free products of groups, Elementary equivalence and relatively free products of lattices, Decidable metric logics, A semigroup of theories and its lattice of idempotent elements, Totally categorical groups and rings, \(\aleph_1\)-categorical commutative rings, Towards the decidability of the theory of modules over finite commutative rings, Erratum to: ``Some model-theoretic results in the algebraic theory of quadratic forms, Ranks for families of theories and their spectra, On universal Horn classes categorical in some infinite power, Tree acceptors and some of their applications, Model theory of adeles. I., On elementary theories of lattices of subgroups, For what filters is every reduced product saturated?, On products of structures for generalized logics, Definable families of theories, related calculi and ranks, The recognizability of sets of graphs is a robust property, On N\(^*\)-homogeneous models, A logic-based approach to incremental reasoning on multi-agent systems, First order theory of permutation groups, Rings of finite representation type and modules of finite Morley rank, The real-algebraic structure of Scott's model of intuitionistic analysis, Stationary logic of ordinals, Hyperarithmetical relations in expansions of recursive structures, A portrait of Alfred Tarski, Combining sets with cardinals
