Search
Skip to Search Results- 12Pelletier, Francis J.
- 1Elio, Renée
- 1Ferenz, Nicholas
- 1Lee, Yun Sup.
- 1Linsky, Bernard
- 1Lounsbury, Michael
- 14Philosophy, Department of
- 8Philosophy, Department of/Journal Articles (Philosophy)
- 7Graduate and Postdoctoral Studies (GPS), Faculty of
- 7Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 5Philosophy, Department of/Book Reviews (Philosophy)
- 2Toolkit for Grant Success
-
1982
Pelletier, Francis J., Schubert, Lenhart K.
Introduction: We describe an approach to parsing and logical translation that was inspired by Gazdar's work on context-free grammar for English. Each grammar rule consists of a syntactic part that specifies an acceptable fragment of a parse tree, and a semantic part that specifies how the logical...
-
1986
Pelletier, Francis J., Rudnicki, Piotr
Introduction: Some problems that are difficult for automated theorem provers (ATPs) are so merely because of their size, but not because of any logical or conceptual complexity. Examples of this type of difficult problem have been published in the past: see Pelletier [1986: problems 12, 29, 34,...
-
1977
It is an extremely popular view among logicians and some linguists (McCawley, Hurford) that there are two distinct or's in English - an \"inclusive\" and an \"exclusive\". It seems equally popular among lexicographers, experts on proper usage, and some linguists (R. Lakoff) that there is only...
-
Fall 2014
Inconsistent and collapse models of arithmetic are presented in the language and semantics of the simple paraconsistent logic LP. I present a logic which extends LP by the addition of a sensible conditional connective and quantifiers. This logic, called A 3 , is specified as a Hilbert style axiom...
-
Spring 2020
Applications of formal logic often require the language of the logics to be sufficiently expressive, capturing notions such as necessity, possibility, subject-predicate sentences, quantified sentences, and identity. To this end, logics employ modal operators, first order quantifiers, and an...
-
1976
In their article \"Modality and conversational information\", Groenendijk and Stokhof propose an analysis of modal expressions which contain in their semantic representations one common element—a sentential operator meaning \"is possible\". While their inclusion of conversational information in...