The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 1764 of Mathematical Reviews Vol. , Issue 93d
[page]

1993
*
Mathematical Reviews
*

Wiestaw Dziobiak (PL-TORN)
93d:03028 03B45
Williamson, Timothy (4-OXUC)

*An**alternative**rule**of**disjunction**in**modal**logic*. Notre Dame J. Formal*Logic*33 (1992), no. 1, 89-100. ... It is proved that a number*of*special*modal*systems admit the*alternative**rule**of**disjunction*and the weak*rule**of**disjunction*. ...##
###
Free Choice Permission in Defeasible Deontic Logic
[chapter]

2020
*
Frontiers in Artificial Intelligence and Applications
*

Accordingly, we investigate how to model the guarded form

doi:10.3233/faia200853
fatcat:ou7whfjt7bca3mtxj7hqezwtka
*in*Defeasible Deontic*Logic*extended with*disjunctive*permissions. ... Free Choice Permission is one*of*the challenges for the formalisation*of*norms.*In*this paper, we follow a novel approach that accepts Free Choice Permission*in*a restricted form. ... For Free Choice Permission, the choice among*alternatives*(*disjunctive*permission) is the argument*in*favour*of**an*individual permission (for one*of*the*alternatives*) and the inability to derive the prohibition ...##
###
Answer sets and nonmonotonic S4
[chapter]

1994
*
Lecture Notes in Computer Science
*

The method consists

doi:10.1007/3-540-58025-5_60
fatcat:cdguvxxwrfarrprfk7d5ymlmqa
*in*interpreting the*rules**of**disjunctive*databases as formulas*of*Nelson's constructive*logic*with strong negation, N. ...*In*particular, it is applicable to extended*disjunctive*databases whose*rules*may contain two kinds*of*negation as well as*disjunctive*conclusions. ...*modal*translations*of*database formulas, and for the interest he showed*in*the results*of*[20] . ...##
###
Too Many Alternatives: Density, Symmetry and Other Predicaments

2015
*
Semantics and Linguistic Theory
*

*modal*but

*an*existential

*modal*is

*of*no help. ...

*of*the non-

*logical*vocabulary received

*an*indexical interpretation. ...

##
###
Too Many Alternatives: Density, Symmetry and Other Predicaments

2007
*
Semantics and Linguistic Theory
*

*modal*but

*an*existential

*modal*is

*of*no help. ...

*of*the non-

*logical*vocabulary received

*an*indexical interpretation. ...

##
###
Page 3215 of Mathematical Reviews Vol. 58, Issue 5
[page]

1979
*
Mathematical Reviews
*

The method is extended by revising the

*rules*for quantificational formulas and adding*rules*for the construction*of*“*alternative*-world trees” when*modal*formulas are encountered*in*a given tree. ... Symbolic*Logic*39 (1974), 549-551; MR 50 #12669]: there is a formula 6*of**modal**logic*and*an*effective transformation y mapping formulas*of**modal**logic*such that any formula a is a*logical*consequence ...##
###
Are the Validities of Modal Logic Analytic? Or Analyticity Again, through Information, Proof, Modal Logic and Hintikka

2015
*
Philosophia Scientiæ
*

On the one hand, each

doi:10.4000/philosophiascientiae.1110
fatcat:5cigo4ctmnejhgmebtojwfd3pa
*alternative*concerning the world that can be constructed by means*of*p*in*the framework*of**modal**logic*cannot but be*an*infinite conjunction or*an*infinite set*of*formulas. ... The same term was used*in*Aristotle syllogism to refer to*an*inference*rule*similar to the*rule*EI*of*the deduction calculus for first-order*logic*. ...##
###
Modal Formulas True at Some Point in Every Model

2008
*
The Australasian Journal of Logic
*

*In*a paper on the

*logical*work

*of*the Jains, Graham Priest considers a consequence relation, semantically characterized, which has a natural analogue

*in*

*modal*

*logic*. ... Here we give a syntactic/axiomatic description

*of*the

*modal*formulas which are consequences

*of*the empty set by this relation, which is to say: those formulas which are, for every model, true at some point ... Some words are

*in*order on what might seem to be

*an*

*alternative*-though not simpler, by any customary criterion -to those with expectations grounded

*in*

*modal*

*logics*as opposed to

*modal*quasilogics. ...

##
###
Automata for the mu-calculus and Related Results

1995
*
BRICS Report Series
*

The notion

doi:10.7146/brics.v2i27.19929
fatcat:hsthe4di6bf55meny7epqjgnfu
*of**disjunctive*formula is defined and it is shown<br />that every formula is semantically equivalent to a*disjunctive*formula. ... <br />For these formulas many difficulties encountered*in*the general case may<br />be avoided. For instance, satisfiability checking is linear for*disjunctive*<br />formulas. ... We will say that m is near n iff there is a path from n to m*in*the tableau without*an*application*of**modal**rule*. 3.5. Remark. ...##
###
Free choice permission as resource-sensitive reasoning

2010
*
Semantics and Pragmatics
*

The account here is primarily semantic (as opposed to pragmatic), with no special modes

doi:10.3765/sp.3.10
fatcat:nxijeecf5vbj3ldaazm56fmu6m
*of*composition or special pragmatic*rules*. The paper includes*an*introduction to Linear*Logic*. ... Free choice permission is a long-standing puzzle*in*deontic*logic*and*in*natural language semantics. ...*In*Linear*Logic*, the law*of*excluded middle is not valid for additive*disjunction*, despite the fact that the inference*rule*for additive*disjunction*has the same form as the inference*rule*for classical ...##
###
Parenthesis Notation

2022
*
Journal of Research in Philosophy and History
*

More importantly, it is proved

doi:10.22158/jrph.v5n1p44
fatcat:xplihfqzbrh53pjnfec6htovfu
*in*this paper that we can define*logical*constants such as propositional connectives, quantifiers,*modal*operators and temporal operators*in*the same formula by using only ... The formal language*of*a*logical*system usually contains several types*of*symbols. ... Introduction*Logical*constants such as propositional connectives, quantifiers and*modal*operators are one*of*the core issues*in**logic*research. ...##
###
Spartacus: A Tableau Prover for Hybrid Logic

2010
*
Electronical Notes in Theoretical Computer Science
*

Lazy branching is a generalization

doi:10.1016/j.entcs.2010.04.010
fatcat:bejggi6htndn3gw4hb3vr74i7m
*of*lazy unfolding [32] ,*an*effective optimization technique from DL reasoning. Spartacus is written*in*Standard ML and compiled with MLton. ... We evaluate the practical impact*of*pattern-based blocking and lazy branching for the basic*modal**logic*K and observe high effectiveness*of*both techniques. ... Introduction Automated reasoning*in**modal*and description*logics*(DL) is*an*active field*of*research. Arguably the most successful approach to*modal*reasoning are tableau-based methods. ...##
###
An overview of nonmonotonic reasoning and logic programming

1993
*
The Journal of Logic Programming
*

*In*

*an*extended

*disjunctive*

*logic*program there may be a

*disjunction*

*of*literals

*in*the head

*of*a clause (where a literal is

*an*atom or the

*logical*negation

*of*

*an*atom, written T 1, and the body may contain ... How does one select from

*alternative*semantics for

*logic*programs that contain different

*rules*

*of*default and classical negation? ...

##
###
Free choice and homogeneity

2019
*
Semantics and Pragmatics
*

While this strategy is

doi:10.3765/sp.12.23
fatcat:wsaxwuznxzgodk7glvuqq75ra4
*in*principle promising, one challenge is to make sure such*an*economy principle does not*rule*out too many*logical*forms. ... To*rule*out this sort*of**logical*form, Fox 2007 could appeal to*an*economy principle; for example, perhaps only applying exhaustification when it produces a*logically*stronger meaning, or only when it ... Chemla 2008's theory predicts that existential quantifiers*in*general generate*an*analogue*of*Free Choice: (37) a. Some students will skip exercise A or exercise B. b. ...##
###
The FaCT System
[chapter]

1998
*
Lecture Notes in Computer Science
*

Empirical tests have demonstrated the e ectiveness

doi:10.1007/3-540-69778-0_30
fatcat:qhlhclprfzgdtnv7v7mgibkhdq
*of*the optimised implementation and,*in*particular,*of*the dependency directed backtracking optimisation. ... The correspondence between*modal*and description*logics*also allows FaCT to be used as a theorem prover for the propositional*modal**logics*K, KT, K4 and S4. ... Semantic Branching Search Standard tableaux algorithms use*an*inherently*ine*cient search technique for the non-deterministic expansion*of**disjunctive*formulae|they choose*an*unexpanded*disjunction*and ...
« Previous

*Showing results 1 — 15 out of 11,846 results*