On direct products of theories
From MaRDI portal
Publication:5812176
DOI10.2307/2267454zbMath0047.00704OpenAlexW4242289817MaRDI QIDQ5812176
Publication date: 1952
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2267454
Related Items (40)
On representations of intended structures in foundational theories ⋮ On the complexity of decision using destinies in \(H\)-bounded structures ⋮ A direct proof of the Feferman-Vaught theorem and other preservation theorems in products ⋮ Undecidability of free pseudo-complemented semilattices ⋮ Undecidability of relatively free Hilbert algebras ⋮ NP satisfiability for arrays as powers ⋮ Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Dominoes and the complexity of subclasses of logical theories ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction ⋮ Solving quantified linear arithmetic by counterexample-guided instantiation ⋮ Feferman-vaught decompositions for prefix classes of first order logic ⋮ The lattice of definability: origins, recent developments, and further directions ⋮ Commutative unital rings elementarily equivalent to prescribed product rings ⋮ The periodic power of \(\mathcal A\) and complete Horn theories ⋮ On algebraic array theories ⋮ The completeness of Peano multiplication ⋮ Andrzej Mostowski: A Biographical Note ⋮ Andrzej Mostowski and the Notion of a Model ⋮ A note on direct products ⋮ On direct products of automaton decidable theories ⋮ A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. ⋮ Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems ⋮ Complexity of logical theories involving coprimality ⋮ Elementary theories of completely simple semigroups ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Lattice-theoretic decision problems in universal algebra ⋮ Boolean powers ⋮ In memory of Andrzej Mostowski ⋮ Compositional Failure Detection in Structured Transition Systems ⋮ The Complexity of Decomposing Modal and First-Order Theories ⋮ From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory ⋮ The Compositional Method and Regular Reachability ⋮ COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS ⋮ On the Relative Density of Sets of Integers ⋮ On decidability and axiomatizability of some ordered structures ⋮ A Characterization of Finitely Decidable Congruence Modular Varieties ⋮ Unnamed Item ⋮ Nice infinitary logics
Cites Work
This page was built for publication: On direct products of theories
