Inferentializing consequence

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)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,631
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    5 ( #160,171 of 548,977 )

    Recent downloads (6 months)

    1 ( #63,511 of 548,977 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums