|Abstract||The proof of correctness and completeness of a logical calculus w.r.t. a given semantics can be read as telling us that the tautologies (or, more gen erally, the relation of consequence) specified in a model theoretic way can be equally well specified in a proof theoretic way, by means of the calculus (as the theorems, resp. the relation of inferability of the calculus). Thus we know that both for the classical propositional calculus and for the clas sical predicate calculus theorems and tautologies represent two sides of the same coin. We also know that the relation of inference as instituted by any of the common axiom systems of the classical propositional calculus coin cides with the relation of consequence defined in terms of the truth tables; whereas the situation is a little bit more complicated w.r.t. the classical predicate calculus (the coincidence occurs if we restrict ourselves to closed ∀xFx is inferable from Fx without being its conse formulas; otherwise..|
|Keywords||No keywords specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
A. Carbone (2002). The Cost of a Cycle is a Square. Journal of Symbolic Logic 67 (1):35-60.
Kai Brünnler (2006). Cut Elimination Inside a Deep Inference System for Classical Predicate Logic. Studia Logica 82 (1):51 - 71.
M. G. Beavers (1994). Theorem Counting. Topoi 13 (1):61-65.
Adriana Galli, Marta Sagastume & Gonzalo E. Reyes (2000). Completeness Theorems Via the Double Dual Functor. Studia Logica 64 (1):61-81.
Jerzy Kotas & N. C. A. Costa (1979). A New Formulation of Discussive Logic. Studia Logica 38 (4):429 - 445.
Wim Ruitenburg (1984). On the Period of Sequences (an(P)) in Intuitionistic Propositional Calculus. Journal of Symbolic Logic 49 (3):892 - 899.
Adam Kolany (1997). Consequence Operations Based on Hypergraph Satisfiability. Studia Logica 58 (2):261-272.
Matthew W. McKeon (2010). The Concept of Logical Consequence: An Introduction to Philosophical Logic. Peter Lang Pub..
Georg Moser & Richard Zach (2006). The Epsilon Calculus and Herbrand Complexity. Studia Logica 82 (1):133 - 155.
Added to index2009-01-28
Total downloads5 ( #160,171 of 548,977 )
Recent downloads (6 months)1 ( #63,511 of 548,977 )
How can I increase my downloads?