Results 231 to 240 of about 4,442,858 (282)
Short-chain fatty acids of intestinal origin attenuate protein-bound uremic toxins in patients with chronic kidney disease by protecting the intestinal barrier: a pooled analysis of multiple studies with individualized intervention strategies. [PDF]
BMC GastroenterolWang M +10 more
europepmc +1 more source
Mathematical Logic Quarterly, 1990 Many authors have proposed several systems of ``fuzzy logic'' as formal counterparts of approximate reasoning and these systems are obtained via suitable ``fuzzyfications'' of the ordinary Hilbert-type logical systems. In this paper the possibility of a fuzzyfication of natural deduction is explored and a very general notion of fuzzy natural deduction ...
G. GERLA, TORTORA, ROBERTO
core +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A deficiency of natural deduction
Information Processing Letters, 1987In the article two examples are given, illustrating how Gentzen's system of natural deduction in the present form is not suited to express an effective mathematical reasoning, because natural deduction may lead to rather ineffective proofs. This defect of Gentzen's system consists in the fact that this system does not handle equivalence efficiently ...
exaly +5 more sources
, 2005 Gentzen introduced his sequent calculi LK and LJ, as well as his natural deduction systems NK and NJ, in his celebrated “Investigations into Logical Deduction” (1935). As far as classical logic is concerned both the natural deduction calculus NK and the sequent calculus LK run into serious difficulties from the computational viewpoint.
D'AGOSTINO, Marcello
openaire +3 more sources
Natural Deduction for 'Generally'
Logic Journal of IGPL, 2007Logics for ‘generally’ (LG’s) were introduced for handling assertions with vague notions (e.g. ‘generally’, ‘most’, ‘several’), which occur often in ordinary language and in science. LG’s provide a framework for distinct notions of ‘generally’: one builds a specific logic for the notion one has in mind.
Leonardo B. Vana +2 more
openaire +2 more sources
Journal of Symbolic Logic, 1950
For Gentzen's natural deduction, a formalized method of deduction in quantification theory dating from 1934, these important advantages may be claimed: it corresponds more closely than other methods of formalized quantification theory to habitual unformalized modes of reasoning, and it consequently tends to minimize the false moves involved in seeking ...
openaire +3 more sources
For Gentzen's natural deduction, a formalized method of deduction in quantification theory dating from 1934, these important advantages may be claimed: it corresponds more closely than other methods of formalized quantification theory to habitual unformalized modes of reasoning, and it consequently tends to minimize the false moves involved in seeking ...
openaire +3 more sources
Natural Deduction for Quantum Logic
Logica Universalis, 2022This paper presents a natural deduction system for orthomodular quantum logic. The system is shown to be provably equivalent to Nishimura’s quantum sequent calculus. Through the Curry-Howard isomorphism, quantum λ-calculus is also introduced for which strong normalization property is established.
openaire +2 more sources
A Many‐Sorted Natural Deduction
Computational Intelligence, 1998The goal of this paper is to motivate and define yet another sorted logic, called SND. All the previous sorted logics that can be found in the Artificial Intelligence literature have been designed to be used in (completely) automated deduction. SND has been designed to be used in interactive theorem proving. Because of this shift of focus, SND has been
Alessandro Cimatti +2 more
openaire +4 more sources
Journal of Symbolic Logic, 1965
We consider some natural deduction systems for quantification theory whose only quantificational rules involve elimination of quantifiers. By imposing certain restrictions on the rules, we obtain a system which we term Analytic Natural Deduction; it has the property that the only formulas used in the proof of a given formula X are either subformulas of
openaire +1 more source
We consider some natural deduction systems for quantification theory whose only quantificational rules involve elimination of quantifiers. By imposing certain restrictions on the rules, we obtain a system which we term Analytic Natural Deduction; it has the property that the only formulas used in the proof of a given formula X are either subformulas of
openaire +1 more source