Approximating Propositional Calculi by Finite-valued Logics

Details Approximating Propositional Calculi by Finite-valued Logics Approximating Propositional Calculi by Finite-valued Logics

2002-03-19

arxiv.org/abs/math/0203204v1

Mathematics

Logic

20 pages

Scientific paper

Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few tautologies as possible, but which has all the valid formulas of the given logic as tautologies. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of finite-valued logics. It is shown that the best candidate matrices for (1) can be computed from a calculus, and how sequences for (2) can be found for certain classes of logics (including, in particular, logics characterized by Kripke semantics).

Affiliated with

Also associated with

No associations

Rating

Approximating Propositional Calculi by Finite-valued Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating Propositional Calculi by Finite-valued Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Propositional Calculi by Finite-valued Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495217