Relevant and Substructural Logics
... made clear in this area: the splitting of notions identified in stronger logical systems. Had Orlov noticed that one could define conjunction explicitly following the lattice definitions (as is done in intuitionistic logic, where the definitions in terms of negation and implication also fail) then h ...
... made clear in this area: the splitting of notions identified in stronger logical systems. Had Orlov noticed that one could define conjunction explicitly following the lattice definitions (as is done in intuitionistic logic, where the definitions in terms of negation and implication also fail) then h ...
Ethical Intuitionism: The Meaning of Meaning Senior
... the ontological. In terms of ontology, logic truth helps justify the existence of moral truth: both of which cannot be observed. Here, the indisputable truth-value that axioms of logic enjoy despite their dissonance with Darwinian naturalism demonstrates that it is sometimes sensible to assert the e ...
... the ontological. In terms of ontology, logic truth helps justify the existence of moral truth: both of which cannot be observed. Here, the indisputable truth-value that axioms of logic enjoy despite their dissonance with Darwinian naturalism demonstrates that it is sometimes sensible to assert the e ...
Inductive Types in Constructive Languages
... The central part of the treatise consists of the description and justification of inductive types as initial algebras. First, I consider at an abstract level the various ways of specifying inductive types, and how these specifications designate (via a polynomial functor) an algebra signature, possib ...
... The central part of the treatise consists of the description and justification of inductive types as initial algebras. First, I consider at an abstract level the various ways of specifying inductive types, and how these specifications designate (via a polynomial functor) an algebra signature, possib ...
A Qualitative Theory of Dynamic Interactive Belief Revision
... conditional reasoning [50, 52]. In [8] and [10], we introduced two equivalent semantic settings for conditional beliefs in a multi-agent epistemic context (conditional doxastic models and epistemic plausibility models), taking the first setting as the basic one. Here, we adopt the second setting, wh ...
... conditional reasoning [50, 52]. In [8] and [10], we introduced two equivalent semantic settings for conditional beliefs in a multi-agent epistemic context (conditional doxastic models and epistemic plausibility models), taking the first setting as the basic one. Here, we adopt the second setting, wh ...
![A Supervised Learning Approach to Search of Definitions[*]](http://s1.studyres.com/store/data/000915212_1-e6ead5920882f42bbabc8ddda61cd38a-300x300.png)
A Supervised Learning Approach to Search of Definitions[*]
... Abstract This paper addresses the issue of search of definitions. Specifically, given a term, we are to find definition candidates of the term and rank the candidates according to their likelihood of being good definitions. This is in contrast to the traditional approaches of either generating a sin ...
... Abstract This paper addresses the issue of search of definitions. Specifically, given a term, we are to find definition candidates of the term and rank the candidates according to their likelihood of being good definitions. This is in contrast to the traditional approaches of either generating a sin ...
The Pure Calculus of Entailment Author(s): Alan Ross Anderson and
... This rule leads immediately to the following theorem, the law of identity:7 6 We are taking rather than entailment to be a relation between propositions, we will in the future observe and with this understanding sentences or statements, a distinction between use and mention only where it seems essen ...
... This rule leads immediately to the following theorem, the law of identity:7 6 We are taking rather than entailment to be a relation between propositions, we will in the future observe and with this understanding sentences or statements, a distinction between use and mention only where it seems essen ...
AGM Postulates in Arbitrary Logics: Initial Results and - FORTH-ICS
... knowledge previously unknown to the KB; this would be irrational, as the contraction operation is used to remove knowledge from a KB. The postulate of vacuity covers the special case where the contracted expression is not part of our theory, so it is not known to be true; in this case, there is no n ...
... knowledge previously unknown to the KB; this would be irrational, as the contraction operation is used to remove knowledge from a KB. The postulate of vacuity covers the special case where the contracted expression is not part of our theory, so it is not known to be true; in this case, there is no n ...
Mathematical Logic
... Definition 1.1.2. A propositional language L is a set of propositional atoms p, q, r, . . .. An atomic L-formula is an atom of L. Definition 1.1.3. The set of L-formulas is generated inductively according to the following rules: 1. If p is an atomic L-formula, then p is an L-formula. 2. If A is an L ...
... Definition 1.1.2. A propositional language L is a set of propositional atoms p, q, r, . . .. An atomic L-formula is an atom of L. Definition 1.1.3. The set of L-formulas is generated inductively according to the following rules: 1. If p is an atomic L-formula, then p is an L-formula. 2. If A is an L ...
Plausibility structures for default reasoning
... required here), we have ϕ → ψ iff (ϕ∧ψ) ∨ (ϕ∧¬ψ) → ϕ∧ψ. This result has been more or less implicitly used by various approaches for default reasoning, such as “expectations” [6] or possibilistic logic [1], and by Friedman and Halpern which, in [4, 5], have generalized these approaches as described n ...
... required here), we have ϕ → ψ iff (ϕ∧ψ) ∨ (ϕ∧¬ψ) → ϕ∧ψ. This result has been more or less implicitly used by various approaches for default reasoning, such as “expectations” [6] or possibilistic logic [1], and by Friedman and Halpern which, in [4, 5], have generalized these approaches as described n ...
MoL-2013-07 - Institute for Logic, Language and Computation
... construct by using this technique, is ϕ already true?”. Note that the answers to these questions do not depend on what ϕ and ψ are, but only on the nature of these model-transformation techniques. These questions were first considered by Hamkins in [Ham03]. In particular, Hamkins showed that by inte ...
... construct by using this technique, is ϕ already true?”. Note that the answers to these questions do not depend on what ϕ and ψ are, but only on the nature of these model-transformation techniques. These questions were first considered by Hamkins in [Ham03]. In particular, Hamkins showed that by inte ...
