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
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, Intersections of finitely generated clones, Lyndon's groupoid is not inherently nonfinitely based, Algebras of prime cardinality with a cyclic automorphism, Disjunctive closures for knowledge compilation, 2-element matrices, Optimal satisfiability for propositional calculi and constraint satisfaction problems., Learnability of quantified formulas., Structure of clones in the precomplete class of self-dual functions in three-valued logic, A criterion for the decidability of the \(A\)-completeness problem for definite automata, Cardinality of the set of delta-closed classes of functions of multi-valued logic, Computational complexity of auditing finite attributes in statistical databases, On Boolean primitive positive clones, Minor posets of functions as quotients of partition lattices, Dualizing clones into categories of topological spaces., Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics, Boolean max-co-clones, On the parameterized complexity of non-monotonic logics, First-order logic and first-order functions, Isomorphism and local isomorphism of clones of spaces, Generating sequences for \(k\)-valued logic, Structure identification of Boolean relations and plain bases for co-clones, Transformation monoids with finite monoidal intervals, Key (critical) relations preserved by a weak near-unanimity function, A field guide to equational logic, Gap theorems for robust satisfiability: Boolean CSPs and beyond, The complexity of circumscriptive inference in Post's lattice, Trichotomies in the complexity of minimal inference, Clones with finitely many relative \({\mathcal R}\)-classes, Simple Abelian algebras, Automata algebras, Recognizing frozen variables in constraint satisfaction problems, The axiomatization of override and update, Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms, The number of self-dual types in finite-valued logics, The fine spectrum of a variety, The set of maximal closed classes of operations on an infinite set \(A\) has cardinality \(2^{2| A|}\), A note on the expressibility problem for modal logics and star-free regular expressions, Generalized modal satisfiability, The complexity of propositional implication, Information loss in knowledge compilation: a comparison of Boolean envelopes, Schönfinkel-type operators for classical logic, Characteristic measures of switching functions, A functional completeness theorem for De Morgan functions., Congruence-distributive polynomial reducts of lattices, Equivalence of operations with respect to discriminator clones, The complexity of satisfiability problems: Refining Schaefer's theorem, The unique minimal clone with three essentially binary operations, A projection property, Clone classification of dually discriminator algebras with finite support, Inductive representations of Boolean functions and the finite generation of the Post classes, Existence of finite bases in closed classes of Boolean functions, Functional completeness in iterative meta-algebras, Finite degree: algebras in general and semigroups in particular, Application of bi-elemental Boolean algebra to electronic circuits, Issues of algorithmics and Glushkov's systems of algorithmic algebras, All clones are centralizer clones, Bases for Boolean co-clones, Nontabularity of the logic S4 with respect to functional completeness, Unary polynomials in algebras. I, Generalized equivalence: A pattern of mathematical expression, Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\), Post classes characterized by functional terms, Closure operators with positive connectives and quantifiers, Unnamed Item, On classes of superfunctions on two-element set, The median in multidimensional spaces, The orbit of closure-involution operations: the case of Boolean functions, Characterization of zigzag De Morgan functions, Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes, On the centralizer of the join operation of a finite lattice, What makes propositional abduction tractable, Algebra of algorithms and Kaluzhnin's graph-schemas, Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis, Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus, Finite sublattices in the lattice of clones, Superassociative systems and logical functors, Classes of functions of multi-valued logic closed with respect to superposition and inversion operations, An unexpected Boolean connective, Monoid intervals in lattices of clones, On separation of Boolean clones by means of hyperidentities, Unnamed Item, Functional completeness criteria in Dijkstra algebra, Classes of valuations closed under operations Galois-dual to Boolean sentence connectives, The connectivity of Boolean satisfiability: dichotomies for formulas and circuits, Varying interpolation and amalgamation in polyadic MV-algebras, A general Galois theory for operations and relations in arbitrary categories, The cardinality of the set of all clones containing a given minimal clone on three elements, Lewis dichotomies in many-valued logics, CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS, Parallelizable algebras, Menger Algebras and Clones of Cooperations, Polynomial clone reducibility, Monoidal intervals on three- and four-element sets, On bases of closed classes of Boolean vector functions, Closed sets of finitary functions between finite fields of coprime order, The complexity of problems for quantified constraints, From logical gates synthesis to chromatic bicritical clutters, Weak bases of Boolean co-clones, Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint, Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem, The maximal cardinality of the base in \(P_2\times P_2 \), Maximal clones in monoidal intervals. I, Criteria of functional completeness for meta-algebras without assignments of logical constants, Algebra of algorithmics and design of systems for synthesis of multimedia applications in the windows environment, Unnamed Item, Why Post Did [Not Have Turing’s Thesis], Monoidal intervals of clones on infinite sets, The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems, The lattice of monomial clones on finite fields, EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER, On self-correcting logic circuits of unreliable gates, On the efficiency of normal form systems for representing Boolean functions, On the clone of aggregation functions on bounded lattices, Subalgebra lattices of totally reflexive sub-preprimal algebras, On the distribution of three-valued functions over precomplete classes, Dichotomy results for fixed point counting in Boolean dynamical systems, Über den Untergruppenverband der symmetrischen Gruppe, den Unterhablgruppenverband der symmetrischen Halbgruppe und den Unteralgebrenverband der Postschen Algebra. (The lattice of subgroups of the symmetric group, the lattice of subsemigroups of the symmetric semigroup, and the lattice of subalgebras of the Post algebra), On congruences in closed Post classes, Unnamed Item, On the role of logical connectives for primality and functional completeness of algebras of logics, Combinatorial problems raised from 2-semilattices, The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis, Satisfiability problems for propositional calculi, On the cardinality of the family of precomplete classes in \(P_{E}\), The generation of clones with majority operations, TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS, Closed classes generated by symmetric functions in the three-valued logic, Classes generated by monotone symmetric functions in the three-valued logic, Equivalent transformations of formulas in \(P_2\)., Completeness of systems of functions for classes of extended superposition, Dichotomy for finite tournaments of mixed-type, Endpoints of associated intervals for local clones on an infinite set, On function classes in \(P _{3}\) precomplete with respect to a strengthened closure operator, Endoprimal distributive lattices, Solution sets of systems of equations over finite lattices and semilattices, On the complexity of the clone membership problem, A grammar of functions, A grammar of functions. II, Closed sets of finitary functions between products of finite fields of coprime order, Infinitely generated classes of 01-functions of three-valued logic, UNCOUNTABLY MANY DUALISABLE ALGEBRAS, Two-element structures modulo primitive positive constructability, Simple bases and the number of functions in certain classes introduced by Post, Term operations in \(\mathcal{V}(N_5)\), Unnamed Item, Combining fragments of classical logic: when are interaction principles needed?, The model checking fingerprints of CTL operators, A classification of universal algebras by infinitary relations, Solvability of the problem of completeness of automaton basis depending on its Boolean part, On some properties of vector functions of Boolean algebra, Maximal clones on algebras A and A\(^r\), Cardinality of generating sets for operations from the Post lattice classes, Some maximal closed classes of operations on infinite sets, Finite degree clones are undecidable, Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions, Set-reconstructibility of Post classes, On the number of universal algebraic geometries, Hypomorphic Sperner systems and non-reconstructible functions, Idempotent variations on the theme of exclusive disjunction, Functional clones and expressibility of partition functions
