A minimum calculus for logic

1944 ◽  
Vol 9 (4) ◽  
pp. 89-94 ◽  
Author(s):  
Frederic B. Fitch
Keyword(s):  
Truth Table ◽  
Additional Property ◽  
Basic Logic ◽  
Double Negation ◽  
Logical Calculus ◽  
Logical Calculi

A logical calculus will be presented which not only is a formulation of a “basic logic” in the sense of the writer's previous papers, but which has the additional property that no weaker calculus can be a formulation of a basic logic. A sort of minimum logical calculus is thus attained, which has nothing superfluous about it for achieving the purpose for which it is designed.In the case of some logical calculi the question can arise as to whether certain of the postulates are really logically valid and necessary. Sometimes a test is available, such as the truth-table test, enabling us to distinguish between logically valid sentences and others, but often no such test is available, especially where quantifiers are involved. Is or is not the axiom of infinity, for example, to be regarded as logically valid? Or is the principle of double negation really acceptable, even though it satisfies the truth-table test?

Correction to a definition of negation

1984 ◽  
Vol 49 (1) ◽  
pp. 47-50 ◽  
Author(s):  
Frederic B. Fitch
Keyword(s):  
Fixed Point ◽  
Personal Communication ◽  
The Other ◽  
Transfinite Induction ◽  
Original Form ◽  
Basic Logic ◽  
Double Negation ◽  
Original Letter ◽  
The Law ◽  
Definition Of

In [3] a definition of negation was presented for the system K′ of extended basic logic [1], but it has since been shown by Peter Päppinghaus (personal communication) that this definition fails to give rise to the law of double negation as I claimed it did. The purpose of this note is to revise this defective definition in such a way that it clearly does give rise to the law of double negation, as well as to the other negation rules of K′.Although Päppinghaus's original letter to me was dated September 19, 1972, the matter has remained unresolved all this time. Only recently have I seen that there is a simple way to correct the definition. I am of course very grateful to Päppinghaus for pointing out my error in claiming to be able to derive the rule of double negation from the original form of the definition.The corrected definition will, as before, use fixed-point operators to give the effect of the required kind of transfinite induction, but this time a double transfinite induction will be used, somewhat like the double transfinite induction used in [5] to define simultaneously the theorems and antitheorems of system CΓ.

scholarly journals Quasi-N4-Lattices

2021 ◽  
Author(s):  
Umberto Rivieccio
Keyword(s):  
Paraconsistent Logic ◽  
General Setting ◽  
Extension Property ◽  
Double Negation ◽  
Structure Representation ◽  
Nelson Algebras ◽  
Nelson Logic ◽  
Double Negation Law ◽  
Logical Calculi ◽  
Twist Structure

Abstract Within the Nelson family, two mutually incomparable generalizations of Nelson constructive logic with strong negation have been proposed so far. The first and more well-known, Nelson paraconsistent logic , results from dropping the explosion axiom of Nelson logic; a more recent series of papers considers the logic (dubbed quasi-Nelson logic ) obtained by rejecting the double negation law, which is thus also weaker than intuitionistic logic. The algebraic counterparts of these logical calculi are the varieties of N4-lattices and quasi-Nelson algebras . In the present paper we propose the class of quasi- N4-lattices as a common generalization of both. We show that a number of key results, including the twist-structure representation of N4-lattices and quasi-Nelson algebras, can be uniformly established in this more general setting; our new representation employs twist-structures defined over Brouwerian algebras enriched with a nucleus operator. We further show that quasi-N4-lattices form a variety that is arithmetical, possesses a ternary as well as a quaternary deductive term, and enjoys EDPC and the strong congruence extension property.

scholarly journals PERANGKAIAN GERBANG LOGIKA DENGAN MENGGUNAKAN MATLAB (SIMULINK)

JURTEKSI ◽  
2019 ◽  
Vol 5 (1) ◽  
pp. 63-70
Author(s):  
Ikhsan Parinduri ◽  
Siti Nurhabibah Hutagalung
Keyword(s):  
Logic Gate ◽  
Truth Table ◽  
Higher Learning ◽  
Digital Systems ◽  
Basic Logic ◽  
Matlab Simulink ◽  
Matlab Program ◽  
Gate Circuit ◽  
Digital Engineering

Abstrack: The logic gate circuit using the simulink method matlab is a series of ways to prove between theories in simulation using the matlab program by entering parameters in the truth table at each logic gate. Parameters in the truth table consist of logic 0 for low and logic 1 for high. The simulation is done by giving input (input) and outpout (output) at each basic logic gate which consists of 7 gates of which are NOT gates, AND, OR, NAND, NOR, X-OR and X-NOR. This proof is intended as a medium to study the logic gate in higher learning learning in digital engineering learning and digital systems. Keywords: Logic Gate, Matlab, Simulink Abstrak: Perangkaian gerbang logika dengan menggunakan matlab metode simulink adalah perangkaian dengan cara pembuktian antara teori pada simulasi menggunakan program matlab dengan memasukkan parameter-paramater yang ada pada tabel kebenaran pada setiap gerbang logika. Paramter-paramater pada tabel kebenaran terdiri atas logika 0 untuk low dan logika 1 untuk high. Simulasi dilakukan dengan memberikan input (masukan) dan outpout (keluaran) pada setiap gerbang logika dasar yang teriri dari 7 gerbang daiantaranya adalah gerbang NOT, AND, OR, NAND, NOR, X-OR dan X-NOR. Pembuktian ini bertujuan sebagai media untuk mempelajari gerbang logika pada pembelajaran diperguruan tinggi pada pembelajaran teknik digital maupun sistem digital.Kata kunci : Gerbang Logika, Matlab, Simulink

An extension of basic logic

1948 ◽  
Vol 13 (2) ◽  
pp. 95-106 ◽  
Author(s):  
Frederic B. Fitch
Keyword(s):  
Subsequent Paper ◽  
Basic Logic ◽  
Infinite Class ◽  
Logical Calculus ◽  
Recursive Enumerability ◽  
Basic Calculus

A logical calculus Κ was defined in a previous paper and then shown in a subsequent paper to contain within itself a representation of every constructively definable subclass of expressions of a certain infinite class U of expressions, where Κ itself is one such subclass. (The former paper will be referred to as BL and the latter paper as RC.) The calculus Κ was called a “basic calculus” and its theorems were thought of as expressing the asserted propositions of a “basic logic,” that is, of a logic within which is definable every constructively definable system of logic and indeed every constructively definable class or relation. The notion of constructive definability was essentially equated with the notion of recursive enumerability.

Leibniz's interpretation of his logical calculi

1954 ◽  
Vol 19 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Nicholas Rescher
Keyword(s):  
Formal Logic ◽  
Point Of View ◽  
Symbolic Logic ◽  
Logical Calculus ◽  
Formal Systems ◽  
Logical Calculi

The historical researches of Louis Couturat saved the logical work of Leibniz from the oblivion of neglect and forgetfulness. They revealed that Leibniz developed in succession several versions of a “logical calculus” (calculus ratiocinator or calculus universalis). In consequence of Couturat's investigations it has become well known that Leibniz's development of these logical calculi adumbrated the notion of a logistic system; and for these foreshadowings of the logistic treatment of formal logic Leibniz is rightly regarded as the father of symbolic logic.It is clear from what has been said that it is scarcely possible to overestimate the debt which the contemporary student of Leibniz's logic owes to Couturat. This gratitude must, however, be accompanied by the realization that Couturat's own theory of logic is gravely defective. Couturat was persuaded that the extensional point of view in logic is the only one which is correct, an opinion now quite antiquated, and shared by no one. This prejudice of Couturat's marred his exposition of Leibniz's logic. It led him to battle with windmills: he viewed the logic of Leibniz as rife with shortcomings stemming from an intensional approach.The task of this paper is a re-examination of Leibniz's logic. It will consider without prejudgment how Leibniz conceived of the major formal systems he developed as logical calculi – that is, these systems will be studied with a view to the interpretation or interpretations which Leibniz himself intends for them. The aim is to undo some of the damage which Couturat's preconception has done to the just understanding of Leibniz's logic and to the proper evaluation of his contribution.

Test d’Indépendance au Contexte (TIC) et Structure des Représentations Sociales

2008 ◽  
Vol 67 (2) ◽  
pp. 119-123 ◽  
Author(s):  
Grégory Lo Monaco ◽  
Florent Lheureux ◽  
Séverine Halimi-Falkowicz
Keyword(s):  
Double Negation ◽  
Représentations Sociales ◽  
Representations Sociales

Deux techniques permettent le repérage systématique du système central d’une représentation sociale: la technique de la mise en cause (MEC) et le modèle des schèmes cognitifs de base (SCB). Malgré cet apport, ces techniques présentent des inconvénients: la MEC, de par son principe de double négation, et les SCB, de par la longueur de passation. Une nouvelle technique a été développée: le test d’indépendance au contexte (TIC). Elle vise à rendre compte des caractères trans-situationnel ou contingent des éléments représentationnels, tout en présentant un moindre coût cognitif perçu. Deux objets de représentation ont été étudiés auprès d’une population étudiante. Les résultats révèlent que le TIC paraît, aux participants, cognitivement moins coûteux que la MEC. De plus, le TIC permet un repérage du noyau central identique à celui offert par la MEC.

Combinational Logic Analysis Using Laser Voltage Probing

2015 ◽  
Author(s):  
Venkat Krishnan Ravikumar ◽  
Winson Lua ◽  
Seah Yi Xuan ◽  
Gopinath Ranganathan ◽  
Angeline Phoa
Keyword(s):  
Failure Analysis ◽  
Continuous Wave ◽  
Truth Table ◽  
Combinational Logic ◽  
Infra Red ◽  
Analysis Design ◽  
Logic State

Abstract Laser Voltage Probing (LVP) using continuous-wave near infra-red lasers are popular for failure analysis, design and test debug. LVP waveforms provide information on the logic state of the circuitry. This paper aims to explain the waveforms observed from combinational circuitries and use it to rebuild the truth table.

Spreadsheet Generation of a Truth Table

2000 ◽  
Author(s):  
John D. Sullivan
Keyword(s):  
Truth Table

NOR: Truth Table, True Distinction

2020 ◽  
Author(s):  
Steffen Roth
Keyword(s):  
Truth Table
Sign in / Sign up

Export Citation Format

Share Document