Results 61 to 70 of about 127 (109)
A first-order logic with no logical constants.
Notre Dame Journal of Formal Logic, 1987 openaire +2 more sources
TRANSLATING THE LOGICAL CONSTANTS
Comment argumenter en faveur d'une manière particulière de fixer la signification des constantes logiques qui soit incompatible avec une manière différente ? Comment justifier un choix ? Prenant la loi du tiers-exclu comme paradigmatique, je considère deux cas : celui des langues naturelles, et celui de la logique formelle.
openaire +1 more source
Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants
Annals of the Japan Association for Philosophy of Science, 1989 openaire +2 more sources
Logica Universalis, 2018 A possibility of defining logical constants within abstract logical frameworks is discussed, in relation to abstract definition of logical consequence. We propose using duals as a general method of applying the idea of invariance under replacement as a criterion for logicality.
Tin Perkov
exaly +5 more sources
Reassessing logical hylomorphism and the demarcation of logical constants [PDF]
SynthÈse, 2010 The paper investigates the propriety of applying the form versus matter distinction to arguments and to logic in general. Its main point is that many of the currently pervasive views on form and matter with respect to logic rest on several substantive and even contentious assumptions which are nevertheless uncritically accepted.
Catarina Dutilh Novaes
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2013
A constant delay (CD) logic style is proposed in this paper, targeting at full-custom high-speed applications. The CD characteristic of this logic style regardless of the logic type makes it suitable in implementing complicated logic expressions such as addition.
Pierce Chuang +2 more
openaire +1 more source
A constant delay (CD) logic style is proposed in this paper, targeting at full-custom high-speed applications. The CD characteristic of this logic style regardless of the logic type makes it suitable in implementing complicated logic expressions such as addition.
Pierce Chuang +2 more
openaire +1 more source
1980
[Abridged abstract] The goal is to give structural proof-theoretical analyses of logical constants, and thereby provide a criterion for what a logical constant is. Another goal is to illustrate the thesis that structural assumptions of logic are basic and that alternative logics (later called substructural logics) differ from each other only in their ...
Dosen, Kosta, Dosen, Kosta
openaire +1 more source
[Abridged abstract] The goal is to give structural proof-theoretical analyses of logical constants, and thereby provide a criterion for what a logical constant is. Another goal is to illustrate the thesis that structural assumptions of logic are basic and that alternative logics (later called substructural logics) differ from each other only in their ...
Dosen, Kosta, Dosen, Kosta
openaire +1 more source
Pseudo-constant logic optimization
2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors, 2013Constant folding reduces area and enables greater parallelism, but requires circuits with constant inputs. In this work, we extend constant folding to support pseudo-constants, which are values that change with low frequency. We present a method of pseudo-constant logic optimization based on dynamically reconfigurable capabilities of FPGAs, which ...
Aaron Landy, Greg Stitt
openaire +1 more source
The Pragmatics of the Logical Constants
2009Abstract The logical constants are technical terms, invented and precisely defined by logicians for the purpose of producing rigorous formal proofs. Mathematics virtually exhausts the domain of deductive reasoning of any complexity, and it is there that the benefits of this refined form of language are felt.
exaly +2 more sources
On Łukasiewicz Logic with Truth Constants
2007Canonical completeness results for Ł\((\mathcal{C})\), the expansion of Łukasiewicz logic Ł with a countable set of truth-constants \(\mathcal{C}\), have been recently proved in [5] for the case when the algebra of truth constants \(\mathcal{C}\) is a subalgebra of the rational interval [0, 1] ∩ ℚ. The case when \(C \not \subseteq [0, 1] \cap \mathbb{Q}
Roberto Cignoli +2 more
openaire +1 more source