Results 21 to 30 of about 16,210 (208)
The Frege–Geach Problem, Modus Ponens, and Legal Language
Problemos, 2018 [full article, abstract in English; only abstract in Lithuanian] This paper proposes a new pragmatic interpretation of the Frege–Geach problem and presents a possible solution using a model of ascriptive legal language.
Vitaly Ogleznev
doaj +1 more source
Analysis, 2019 Abstract Chancy modus ponens is the following inference scheme: ‘probably φ’, ‘if φ, then ψ’, therefore, ‘probably ψ’ (Yalcin 2010, Moss 2015). I argue that Chancy modus ponens is invalid in general. I further argue that the invalidity of Chancy modus ponens sheds new light on the alleged counterexample to modus ponens presented by McGee
openaire +1 more source
Resolution as intersection subtyping via Modus Ponens [PDF]
Proceedings of the ACM on Programming Languages, 2020 Resolution and subtyping are two common mechanisms in programming languages. Resolution is used by features such as type classes or Scala-style implicits to synthesize values automatically from contextual type information. Subtyping is commonly used to automatically convert the type of a value into another compatible type.
Koar Marntirosian +3 more
openaire +2 more sources
Towards a mental probability logic
Psychologica Belgica, 2005 We propose probability logic as an appropriate standard of reference for evaluating human inferences. Probability logical accounts of nonmonotonic reasoning with SYSTEM P, and conditional syllogisms (MODUS PONENS, etc.) are explored.
Niki Pfeifer, Gernot D. Kleiter
doaj +1 more source
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) [PDF]
, 2014 We produce a decidable super-intuitionistic normal modal logic of internalised intuitionistic (and thus disjunctive and monotonic) interactive proofs (LIiP) from an existing classical counterpart of classical monotonic non-disjunctive interactive proofs (
Kramer, Simon
core +1 more source
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +1 more source
Fully implicational methods for interval-valued fuzzy reasoning with multi-antecedent rules [PDF]
International Journal of Computational Intelligence Systems, 2011 Based on the fully implicational idea, we investigate the interval-valued fuzzy reasoning with multiantecedent rules. First, we construct a class of interval-valued fuzzy implications by means of a type of implications and a parameter on the unit ...
Hua-Wen Liu, Cheng Li
doaj +1 more source
On the Adoption Problem and Meta-Logical Monism
Análisis Filosófico, 2022 According to the Adoption Problem (AP) certain basic logical principles cannot be adopted. Drawing on the AP, Suki Finn presents an argument against logical pluralism: Modus Ponens (MP) and Universal Instantiation (UI) both govern a general structure ...
Mauro Santelli +2 more
doaj +1 more source
Subset models for justification logic [PDF]
, 2019 We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds.
Lehmann, Eveline, Studer, Thomas
core +2 more sources
Revisiting McGee’s Counterexample to Modus Ponens
European Journal of Analytic PhilosophyIn this paper, we provide a novel explanation of McGee’s (1985) alleged counterexample to Modus Ponens for indicative conditionals. Our strategy is to show that pragmatic phenomena interfere with intuitions concerning the acceptability of the inference ...
Nicolás Lo Guercio, Mariela Rubin
doaj +1 more source