The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Recommendations

scientific article; zbMATH DE number 1078559
Two theorems on many-valued logics
Two-valued logic programs
Two-valued and many-valued composition-nominative logics
Two Principles in Many-Valued Logic
Two-Variable Separation Logic and Its Inner Circle
The expressive truth conditions of two-valued logic
Beyond two: Theory and applications of multiple-valued logic
scientific article; zbMATH DE number 17530

Cited in

(only showing first 100 items - show all)

Equivalence of operations with respect to discriminator clones
The complexity of satisfiability problems: Refining Schaefer's theorem
All clones are centralizer clones
Bases for Boolean 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
Galois connection for multiple-output operations
Basic positively closed classes in three-valued logic
Closed classes of polynomials modulo p^2
On the shape of solution sets of systems of (functional) equations
On bases of closed classes of vector functions of many-valued logic
Pivotal decomposition schemes inducing clones of operations
Cardinality of the set of delta-closed classes of functions of multi-valued logic
Minor posets of functions as quotients of partition lattices
On the clone of aggregation functions on bounded lattices
On the distribution of three-valued functions over precomplete classes
Endpoints of associated intervals for local clones on an infinite set
Endoprimal distributive lattices
Pseudo two-valued evaluation method for intermediate logics
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
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
The complexity of problems for quantified constraints
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 the efficiency of normal form systems for representing Boolean functions
Subalgebra lattices of totally reflexive sub-preprimal algebras
On the complexity of the clone membership problem
Closed sets of finitary functions between products of finite fields of coprime order
Infinitely generated classes of 01-functions of three-valued logic
On the number of universal algebraic geometries
Idempotent variations on the theme of exclusive disjunction
On classes of superfunctions on two-element set
The orbit of closure-involution operations: the case of Boolean functions
An unexpected Boolean connective
On bases of closed classes of Boolean vector functions
Closed sets of finitary functions between finite fields of coprime order
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 \)
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
The lattice of monomial clones on finite fields
On self-correcting logic circuits of unreliable gates
Dichotomy results for fixed point counting in Boolean dynamical systems
On congruences in closed Post classes
On the role of logical connectives for primality and functional completeness of algebras of logics
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
Solution sets of systems of equations over finite lattices and semilattices
Two-element structures modulo primitive positive constructability
Term operations in \(\mathcal{V}(N_5)\)
Combining fragments of classical logic: when are interaction principles needed?
The model checking fingerprints of CTL operators
Solvability of the problem of completeness of automaton basis depending on its Boolean part
On some properties of vector functions of Boolean algebra
Cardinality of generating sets for operations from the Post lattice classes
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
Hypomorphic Sperner systems and non-reconstructible functions
Functional clones and expressibility of partition functions
Closure operators with positive connectives and quantifiers
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
What makes propositional abduction tractable
Superassociative systems and logical functors
Classes of functions of multi-valued logic closed with respect to superposition and inversion operations

This page was built for publication: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5845380)