The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
From MaRDI portal
Publication:5845380
DOI10.1515/9781400882366zbMath0063.06326MaRDI QIDQ5845380
Publication date: 1941
Full work available at URL: https://doi.org/10.1515/9781400882366
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
Related Items
Unnamed Item, Unnamed Item, Partial clones containing all permutations, A-classification of idempotent functions of many-valued logic, Unnamed Item, Equational closure, Basics of Galois Connections, 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, Homeomorphism and the equivalence of logical systems, Identities in Two-Valued Calculi, Ü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), Recognizing frozen variables in constraint satisfaction problems, The unique minimal clone with three essentially binary operations, Inductive representations of Boolean functions and the finite generation of the Post classes, Existence of finite bases in closed classes of Boolean functions, Application of bi-elemental Boolean algebra to electronic circuits, Unary polynomials in algebras. I, Composition of Post classes and normal forms of Boolean functions, Descending chains and antichains of the unary, linear, and monotone subfunction relations, Towards a dichotomy theorem for the counting constraint satisfaction problem, Intersections of finitely generated clones, Lyndon's groupoid is not inherently nonfinitely based, Computational complexity of auditing finite attributes in statistical databases, On Boolean primitive positive clones, Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics, Isomorphism and local isomorphism of clones of spaces, Structure identification of Boolean relations and plain bases for co-clones, Nontabularity of the logic S4 with respect to functional completeness, Generalized equivalence: A pattern of mathematical expression, Every idempotent plain algebra generates a minimal variety, Positive Boolean dependencies, Finite algebras with large free spectra, Shuffle on trajectories: Syntactic constraints, A proof of Lyndon's finite basis theorem, Algebras of prime cardinality with a cyclic automorphism, 2-element matrices, Generating sequences for \(k\)-valued logic, A field guide to equational logic, Simple Abelian algebras, 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|}\), Characteristic measures of switching functions, Congruence-distributive polynomial reducts of lattices, A projection property, Clone classification of dually discriminator algebras with finite support, Functional completeness in iterative meta-algebras, Issues of algorithmics and Glushkov's systems of algorithmic algebras, Term minimal algebras, Optimal satisfiability for propositional calculi and constraint satisfaction problems., Learnability of quantified formulas., Inherently nonfinitely based lattices, Endoprimal distributive lattices, Some maximal closed classes of operations on infinite sets, Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\), Post classes characterized by functional terms, The median in multidimensional spaces, On the centralizer of the join operation of a finite lattice, Algebra of algorithms and Kaluzhnin's graph-schemas, Finite sublattices in the lattice of clones, Monoid intervals in lattices of clones, On separation of Boolean clones by means of hyperidentities, Functional completeness criteria in Dijkstra algebra, Classes of valuations closed under operations Galois-dual to Boolean sentence connectives, From logical gates synthesis to chromatic bicritical clutters, 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, On congruences in closed Post classes, Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes, Superassociative systems and logical functors, Monoidal intervals of clones on infinite sets, Combinatorial problems raised from 2-semilattices, On the cardinality of the family of precomplete classes in \(P_{E}\), On function classes in \(P _{3}\) precomplete with respect to a strengthened closure operator, A grammar of functions, A grammar of functions. II, Simple bases and the number of functions in certain classes introduced by Post, A classification of universal algebras by infinitary relations, Maximal clones on algebras A and A\(^r\), Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus, Unnamed Item, CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS, Menger Algebras and Clones of Cooperations, Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint, Parallelizable algebras, Satisfiability problems for propositional calculi
