The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
From MaRDI portal
Publication:5845380
DOI10.1515/9781400882366zbMath0063.06326OpenAlexW1589711670MaRDI QIDQ5845380
Publication date: 1941
Full work available at URL: https://doi.org/10.1515/9781400882366
Related Items (only showing first 100 items - show all)
Aggregation of Votes with Multiple Positions on Each Issue ⋮ The Classification of Reversible Bit Operations ⋮ An equational logic sampler ⋮ Implication, Equivalence, and Negation ⋮ When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Algebraic Characterization of Testable Boolean CSPs ⋮ The algebra of multiplace vector-valued functions ⋮ Completeness in Finite Algebras with a Single Operation ⋮ Réalisation des fonctions definies dans un ensemble fini à l'aide des organes élémentairesd'entrée-sortie ⋮ Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An algebraic characterization of tractable constraints ⋮ Visualizing polymorphisms and counter-polymorphisms in S5 modal logic ⋮ Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework ⋮ The lattice of clones of self-dual operations collapsed ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ Partial clones containing all permutations ⋮ Closed classes in the functional system of polynomials with real coefficients ⋮ Logical Gates via Gliders Collisions ⋮ On bases of all closed classes of Boolean vector functions ⋮ Reduction theorems in the social choice theory ⋮ Majority-closed minions of Boolean functions ⋮ Definability of Boolean functions in Kripke semantics ⋮ Submaximal clones over a three-element set up to minor-equivalence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Categorical equivalence of clones of operations preserving a nontrivial n-equivalence ⋮ Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory ⋮ Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic ⋮ THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ Henry M. Sheffer and Notational Relativity ⋮ A GENERAL DUALITY THEORY FOR CLONES ⋮ Homeomorphism and the equivalence of logical systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hardness results for the subpower membership problem ⋮ A-classification of idempotent functions of many-valued logic ⋮ Generalized satisfiability problems via operator assignments ⋮ Meet-reducible submaximal clones determined by two central relations ⋮ The Complexity of Satisfiability for Fragments of CTL and CTL⋆ ⋮ The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ Equational closure ⋮ Unnamed Item ⋮ Time Complexity of Constraint Satisfaction via Universal Algebra ⋮ PROJECTIVE CLONE HOMOMORPHISMS ⋮ Unnamed Item ⋮ A complete classification of equational classes of threshold functions included in clones ⋮ Expansions of abelian square-free groups ⋮ Basics of Galois Connections ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations ⋮ A Dichotomy Theorem for the Inverse Satisfiability Problem ⋮ Identities in Two-Valued Calculi ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom ⋮ Inherently nonfinitely based lattices ⋮ Minimal partial ultraclones on a two-element set. ⋮ Dualizing clones as models of Lawvere theories. ⋮ A short introduction to clones. ⋮ Attribute-efficient learning of Boolean functions from Post closed classes ⋮ De Morgan clones and four-valued logics ⋮ Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials ⋮ Every idempotent plain algebra generates a minimal variety ⋮ Term minimal algebras ⋮ The complexity of constraint satisfaction games and QCSP ⋮ On a class of bases for Boolean functions ⋮ Positive Boolean dependencies ⋮ On maximal clones of ultrafunctions of rank 2 ⋮ Composition of Post classes and normal forms of Boolean functions ⋮ Galois connection for multiple-output operations ⋮ Strong partial clones and the time complexity of SAT problems ⋮ Descending chains and antichains of the unary, linear, and monotone subfunction relations ⋮ Closed classes of the three-valued logic generated by systems containing symmetric functions ⋮ Rational equivalence of algebras, its clone generalizations, and clone categoricity. ⋮ Finite algebras with large free spectra ⋮ Fully invariant and verbal congruence relations ⋮ Basic positively closed classes in three-valued logic ⋮ Closed classes of polynomials modulo \(p^2\) ⋮ Towards a dichotomy theorem for the counting constraint satisfaction problem ⋮ On the shape of solution sets of systems of (functional) equations ⋮ On bases of closed classes of vector functions of many-valued logic ⋮ Meet-irreducible submaximal clones determined by nontrivial equivalence relations ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ On the enumeration closure operator in multivalued logic ⋮ Polynomial clones of Mal'cev algebras with small congruence lattices ⋮ A proof of Lyndon's finite basis theorem ⋮ Binary central relations and submaximal clones determined by nontrivial equivalence relations. ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ A stronger LP bound for formula size lower bounds via clique constraints ⋮ Pivotal decomposition schemes inducing clones of operations ⋮ On the applicability of Post's lattice ⋮ Tree search and quantum computation ⋮ Commuting polynomial operations of distributive lattices ⋮ Clones of topological spaces
This page was built for publication: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
