Switch to: References

Add citations

You must login to add citations.
  1. A Sound and Complete Proof Theory for Propositional Logical Contingencies.Charles Morgan, Alexander Hertel & Philipp Hertel - 2007 - Notre Dame Journal of Formal Logic 48 (4):521-530.
    There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for the logical contingencies, that is, formulas that are both satisfiable and falsifiable. This paper formalizes the purely syntactic axiomatic proof systems for the logical contingencies and proves its soundness as well as completeness.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Systems of modal logic for impossible worlds.Charles G. Morgan - 1973 - Inquiry: An Interdisciplinary Journal of Philosophy 16 (1-4):280 – 289.
    The intuitive notion behind the usual semantics of most systems of modal logic is that of ?possible worlds?. Loosely speaking, an expression is necessary if and only if it holds in all possible worlds; it is possible if and only if it holds in some possible world. Of course, contradictory expressions turn out to hold in no possible worlds, and logically true expressions turn out to hold in every possible world. A method is presented for transforming standard modal systems into (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)True and False: An Exchange.Roberto Casati & Achille C. Varzi - 2000 - In André Chapuis & Anil Gupta (eds.), Circularity, Definition and Truth. New Delhi: Sole distributor, Munshiram Manoharlal Publishers. pp. 365-370.
    Classically, truth and falsehood are opposite, and so are logical truth and logical falsehood. In this paper we imagine a situation in which the opposition is so pervasive in the language we use as to threaten the very possibility of telling truth from falsehood. The example exploits a suggestion of Ramsey’s to the effect that negation can be expressed simply by writing the negated sentence upside down. The difference between ‘p’ and ‘~~p’ disappears, the principle of double negation becomes trivial, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Hypothesis generation by machine.Charles G. Morgan - 1971 - Artificial Intelligence 2 (2):179-187.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • What is a logical theory? On theories containing assertions and denials.Carolina Blasio, Carlos Caleiro & João Marcos - 2019 - Synthese 198 (S22):5481-5504.
    The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion by (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Paraconsistency in classical logic.Gabriele Pulcini & Achille C. Varzi - 2018 - Synthese 195 (12):5485-5496.
    Classical propositional logic can be characterized, indirectly, by means of a complementary formal system whose theorems are exactly those formulas that are not classical tautologies, i.e., contradictions and truth-functional contingencies. Since a formula is contingent if and only if its negation is also contingent, the system in question is paraconsistent. Hence classical propositional logic itself admits of a paraconsistent characterization, albeit “in the negative”. More generally, any decidable logic with a syntactically incomplete proof theory allows for a paraconsistent characterization of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A sequent calculus for a logic of contingencies.Michael Tiomkin - 2013 - Journal of Applied Logic 11 (4):530-535.
    Download  
     
    Export citation  
     
    Bookmark   2 citations