Pages that link to "Item:Q5845380"
From MaRDI portal
The following pages link to The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) (Q5845380):
Displayed 50 items.
- Parallelizable algebras (Q3773330) (← links)
- Satisfiability problems for propositional calculi (Q3864500) (← links)
- (Q4389691) (← links)
- (Q4508825) (← links)
- (Q4553280) (← links)
- Varying interpolation and amalgamation in polyadic MV-algebras (Q4586142) (← links)
- (Q4606689) (← links)
- (Q4612556) (← links)
- Categorical equivalence of clones of operations preserving a nontrivial n-equivalence (Q4621415) (← links)
- The Classification of Reversible Bit Operations (Q4638073) (← links)
- Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
- Hardness results for the subpower membership problem (Q4686441) (← links)
- Partial clones containing all permutations (Q4859671) (← links)
- THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS (Q4902687) (← links)
- Henry M. Sheffer and Notational Relativity (Q4914196) (← links)
- A GENERAL DUALITY THEORY FOR CLONES (Q4923198) (← links)
- A-classification of idempotent functions of many-valued logic (Q4947377) (← links)
- (Q4963133) (← links)
- (Q4963135) (← links)
- The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (Q4982095) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- (Q4993594) (← links)
- PROJECTIVE CLONE HOMOMORPHISMS (Q5000252) (← links)
- Expansions of abelian square-free groups (Q5002190) (← links)
- An equational logic sampler (Q5055725) (← links)
- Implication, Equivalence, and Negation (Q5059689) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- (Q5092397) (← links)
- (Q5094139) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- Logical Gates via Gliders Collisions (Q5112170) (← links)
- (Q5131261) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- (Q5150667) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- Meet-reducible submaximal clones determined by two central relations (Q5223094) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- A complete classification of equational classes of threshold functions included in clones (Q5247685) (← links)
- Aggregation of Votes with Multiple Positions on Each Issue (Q5283212) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Equational closure (Q5491213) (← links)
- Basics of Galois Connections (Q5504699) (← links)
- Completeness in Finite Algebras with a Single Operation (Q5538980) (← links)
- (Q5547626) (← links)
- The algebra of multiplace vector-valued functions (Q5620605) (← links)
- Réalisation des fonctions definies dans un ensemble fini à l'aide des organes élémentairesd'entrée-sortie (Q5626528) (← links)
- Identities in Two-Valued Calculi (Q5806804) (← links)
- (Q5863607) (← links)