Abstract
The class of projective propositional logics is defined by a certain format of the definition of truth functions for their connectives with respect to a semantic theory. All finite valued logics, but also infinite valued Gödel logic are shown to be projective. Analytic Gentzen type calculi are uniformly derived for all projective logics. Admissibility of cut rules and other structural rules is investigated. The special case of Gödel logics is exemplified in detail and compared with the previous approach of Avron (based on hypersequents).KeywordsSemantic TheoryClassical LogicTruth FunctionPredicate SymbolPropositional VariableThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
