Random strings and tt-degrees of Turing complete C.E. sets [PDF]
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends ...
Mingzhong Cai +4 more
doaj +3 more sources
An analogy is made between two rather different domains, namely: logic, and football (or soccer). Starting from a comparative table between the two activities, an alternative explanation of logic is given in terms of players, ball, goal, and the like ...
Schang Fabien
doaj +4 more sources
AND and/or OR: Uniform Polynomial-Size Circuits [PDF]
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.
Niall Murphy, Damien Woods
doaj +6 more sources
Proof-irrelevant model of CC with predicative induction and judgmental equality [PDF]
We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding
Gyesik Lee, Benjamin Werner
doaj +3 more sources
Method for synthesizing a logic element that implements several functions simultaneously
Objectives. The basic element of a field-programmable gate array is a lookup table (LUT). While in canonical normal form LUTs generally implement only one logical function for a given configuration, in this case, there is always an inactive pass ...
S. I. Sovetov, S. F. Tyurin
doaj +1 more source
Switch lists in the landscape of knowledge representation languages
A switch-list representation (SLR) of a Boolean function is a compressed truth table representation of a Boolean function in which only the function value of the first row in the truth table and an ordered list of switches are stored.
Ondrej Cepek
doaj +1 more source
Discernibility Matrix and Its Application in Logical Optimization
The simplification of truth table is of great significance to the analysis and design of logic circuits. In this paper, the simplification of truth table is studied, and a method of GDM (granular discernibility matrix) that uses discernibility matrix is ...
YAN Xinyi, WEN Xin, CHEN Zehua
doaj +1 more source
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
The creation of three logical connectors to reapprove how comprehensive and effective the Neutrosophic logic is compared to the fuzzy logic and the classical logic [PDF]
The main objective of this research is a simple attempt to suggest three new logical connectors and establish an equation a chart of truth for each of them.
Salah Bouzina, Djamel Hamoud
doaj +1 more source
Critical Review on the Book To Welcome Contradiction: An Essay on the Paradox, Contradiction, and Dialetheism [PDF]
Defending the truth of some contradictions in the actual world by means of Graham Priest’s views, To Welcome Contradiction written by Rahman Sharifzadeh is rarely problematic in the appearance - i.e in the edition.
Mahdi Assadi
doaj +1 more source

