The following pages link to On direct products of theories (Q5812176):
Displaying 40 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Elementary theories of completely simple semigroups (Q701375) (← links)
- Undecidability of free pseudo-complemented semilattices (Q1098833) (← links)
- Undecidability of relatively free Hilbert algebras (Q1103604) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- The periodic power of \(\mathcal A\) and complete Horn theories (Q1147121) (← links)
- The completeness of Peano multiplication (Q1158147) (← links)
- On direct products of automaton decidable theories (Q1168306) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Lattice-theoretic decision problems in universal algebra (Q1223286) (← links)
- Boolean powers (Q1226512) (← links)
- In memory of Andrzej Mostowski (Q1237769) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- On representations of intended structures in foundational theories (Q2121479) (← links)
- NP satisfiability for arrays as powers (Q2152659) (← links)
- On decidability and axiomatizability of some ordered structures (Q2318170) (← links)
- A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction (Q2668897) (← links)
- Nice infinitary logics (Q2879888) (← links)
- A Characterization of Finitely Decidable Congruence Modular Varieties (Q3127568) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- On the Relative Density of Sets of Integers (Q3244107) (← links)
- (Q3265664) (← links)
- A note on direct products (Q3267402) (← links)
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS (Q3646170) (← links)
- Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems (Q3708211) (← links)
- A direct proof of the Feferman-Vaught theorem and other preservation theorems in products (Q3984437) (← links)
- Andrzej Mostowski: A Biographical Note (Q4611690) (← links)
- Andrzej Mostowski and the Notion of a Model (Q4611699) (← links)
- The Compositional Method and Regular Reachability (Q4982089) (← links)
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. (Q5005180) (← links)
- Compositional Failure Detection in Structured Transition Systems (Q5200059) (← links)
- From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory (Q5214779) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- The lattice of definability: origins, recent developments, and further directions (Q6132481) (← links)
- Commutative unital rings elementarily equivalent to prescribed product rings (Q6146733) (← links)
- On algebraic array theories (Q6192058) (← links)
