Logical Inference in English: A Preliminary Analysis
The perfect fit of syntactic derivability and logical consequence in first-order logic is one of the most celebrated facts of modern logic. In the present flurry of attention given to the semantics of natural language, surprisingly little effort has been focused on the problem of logical inference i...
Saved in:
Published in | Studia logica Vol. 38; no. 4; pp. 375 - 391 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Wroclaw, Poland
Ossolineum and North-Holland
01.01.1979
Ossolineum |
Subjects | |
Online Access | Get full text |
ISSN | 0039-3215 1572-8730 |
DOI | 10.1007/BF00370475 |
Cover
Loading…
Abstract | The perfect fit of syntactic derivability and logical consequence in first-order logic is one of the most celebrated facts of modern logic. In the present flurry of attention given to the semantics of natural language, surprisingly little effort has been focused on the problem of logical inference in natural language and the possibility of its completeness. Even the traditional theory of the syllogism does not give a thorough analysis of the restricted syntax it uses. My objective is to show how a theory of inference may be formulated for a fragment of English that includes a good deal more than the classical syllogism. The syntax and semantics are made as formal and as explicit as is customary for artificial formal languages. The fragment chosen is not maximal but is restricted severely in order to provide a clear overview of the method without the cluttering details that seem to be an inevitable part of any grammar covering a substantial fragment of a natural language. (Some readers may feel the details given here are too onerous.) I am especially concerned with quantifier words in both object and subject position, with negation, and with possession. I do not consider propositional attitudes or the modalities of possibility and necessity, although the model-theoretic semantics I use has a standard version to deal with such intensional contexts. An important point of methodology stressed in earlier publications (Suppes, 1976; Suppes & Macken, 1978; Suppes, 1979) is that the semantic representation of the English sentences in the fragment uses neither quantifiers nor variables, but only constants denoting given sets and relations, and operations on sets and relations. In the first section, I rapidly sketch the formal framework of generative syntax and model-theoretic semantics, with special attention to extended relation algebras. The second section states the grammar and semantics of the fragment of English considered. The next section is concerned with developing some of the rules of inference. The results given are quite incomplete. The final section raises problems of extension. Classical logic is a poor guide for dealing with inferences involving high-frequency function words such as of, to, a, in, for, with, as, on, at, and by. Indeed, the line between logical and nonlogical inference in English seems to be nonexistent or, if made, highly arbitrary in character-much more so than has been claimed by those critical of the traditional analyticsynthetic tradition. No theorems on soundness or completeness are considered because of the highly tentative and incomplete character of the rules of inference proposed. However, because of the variable-free semantics used, soundness is easy to establish for the rules given. |
---|---|
AbstractList | The perfect fit of syntactic derivability and logical consequence in first-order logic is one of the most celebrated facts of modern logic. In the present flurry of attention given to the semantics of natural language, surprisingly little effort has been focused on the problem of logical inference in natural language and the possibility of its completeness. Even the traditional theory of the syllogism does not give a thorough analysis of the restricted syntax it uses. My objective is to show how a theory of inference may be formulated for a fragment of English that includes a good deal more than the classical syllogism. The syntax and semantics are made as formal and as explicit as is customary for artificial formal languages. The fragment chosen is not maximal but is restricted severely in order to provide a clear overview of the method without the cluttering details that seem to be an inevitable part of any grammar covering a substantial fragment of a natural language. (Some readers may feel the details given here are too onerous.) I am especially concerned with quantifier words in both object and subject position, with negation, and with possession. I do not consider propositional attitudes or the modalities of possibility and necessity, although the model-theoretic semantics I use has a standard version to deal with such intensional contexts. An important point of methodology stressed in earlier publications (Suppes, 1976; Suppes & Macken, 1978; Suppes, 1979) is that the semantic representation of the English sentences in the fragment uses neither quantifiers nor variables, but only constants denoting given sets and relations, and operations on sets and relations. In the first section, I rapidly sketch the formal framework of generative syntax and model-theoretic semantics, with special attention to extended relation algebras. The second section states the grammar and semantics of the fragment of English considered. The next section is concerned with developing some of the rules of inference. The results given are quite incomplete. The final section raises problems of extension. Classical logic is a poor guide for dealing with inferences involving high-frequency function words such as of, to, a, in, for, with, as, on, at, and by. Indeed, the line between logical and nonlogical inference in English seems to be nonexistent or, if made, highly arbitrary in character-much more so than has been claimed by those critical of the traditional analyticsynthetic tradition. No theorems on soundness or completeness are considered because of the highly tentative and incomplete character of the rules of inference proposed. However, because of the variable-free semantics used, soundness is easy to establish for the rules given. |
Author | Suppes, Patrick |
Author_xml | – sequence: 1 givenname: Patrick surname: Suppes fullname: Suppes, Patrick |
BookMark | eNptkM1LAzEUxINUsK1evAsL3oTVl69N4q2WVgsLetDzks0mNWWbrcn20P_elYqCeHow_GaYNxM0Cl2wCF1iuMUA4u5hCUAFMMFP0BhzQXIpKIzQeJBVTgnmZ2iS0gYASKHUGLGyW3uj22wVnI02GJv5kC3CuvXp_T6bZS_Rtn7rg46HbBZ0e0g-naNTp9tkL77vFL0tF6_zp7x8flzNZ2VusCr63BlMjGyIdLRhdaN1I4lQDSuwdKShihHJHK8LKrSuGwlE1dwYh0EXQkte0Cm6PubuYvext6mvNt0-DiVShYlSinNVsIGCI2Vil1K0rjK-173vQh-1bysM1dc21e82g-Xmj2UX_XZ48X_46ghvUt_FH5IAYKa4pJ9y2m1c |
CitedBy_id | crossref_primary_10_1007_BF00370426 crossref_primary_10_2307_2273980 crossref_primary_10_1007_s11225_012_9425_8 crossref_primary_10_1007_BF00374050 |
ContentType | Journal Article |
DBID | AAYXX CITATION HFIND IOIBA K30 PAAUG PAWHS PAWZZ PAXOH PBHAV PBQSW PBYQZ PCIWU PCMID PCZJX PDGRG PDWWI PETMR PFVGT PGXDX PIHIL PISVA PJCTQ PJTMS PLCHJ PMHAD PNQDJ POUND PPLAD PQAPC PQCAN PQCMW PQEME PQHKH PQMID PQNCT PQNET PQSCT PQSET PSVJG PVMQY PZGFC |
DOI | 10.1007/BF00370475 |
DatabaseName | CrossRef Periodicals Index Online Segment 16 Periodicals Index Online Segment 29 Periodicals Index Online Primary Sources Access—Foundation Edition (Plan E) - West Primary Sources Access (Plan D) - International Primary Sources Access & Build (Plan A) - MEA Primary Sources Access—Foundation Edition (Plan E) - Midwest Primary Sources Access—Foundation Edition (Plan E) - Northeast Primary Sources Access (Plan D) - Southeast Primary Sources Access (Plan D) - North Central Primary Sources Access—Foundation Edition (Plan E) - Southeast Primary Sources Access (Plan D) - South Central Primary Sources Access & Build (Plan A) - UK / I Primary Sources Access (Plan D) - Canada Primary Sources Access (Plan D) - EMEALA Primary Sources Access—Foundation Edition (Plan E) - North Central Primary Sources Access—Foundation Edition (Plan E) - South Central Primary Sources Access & Build (Plan A) - International Primary Sources Access—Foundation Edition (Plan E) - International Primary Sources Access (Plan D) - West Periodicals Index Online Segments 1-50 Primary Sources Access (Plan D) - APAC Primary Sources Access (Plan D) - Midwest Primary Sources Access (Plan D) - MEA Primary Sources Access—Foundation Edition (Plan E) - Canada Primary Sources Access—Foundation Edition (Plan E) - UK / I Primary Sources Access—Foundation Edition (Plan E) - EMEALA Primary Sources Access & Build (Plan A) - APAC Primary Sources Access & Build (Plan A) - Canada Primary Sources Access & Build (Plan A) - West Primary Sources Access & Build (Plan A) - EMEALA Primary Sources Access (Plan D) - Northeast Primary Sources Access & Build (Plan A) - Midwest Primary Sources Access & Build (Plan A) - North Central Primary Sources Access & Build (Plan A) - Northeast Primary Sources Access & Build (Plan A) - South Central Primary Sources Access & Build (Plan A) - Southeast Primary Sources Access (Plan D) - UK / I Primary Sources Access—Foundation Edition (Plan E) - APAC Primary Sources Access—Foundation Edition (Plan E) - MEA |
DatabaseTitle | CrossRef Periodicals Index Online Segments 1-50 Periodicals Index Online Segment 16 Periodicals Index Online Periodicals Index Online Segment 29 |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Philosophy |
EISSN | 1572-8730 |
EndPage | 391 |
ExternalDocumentID | 10_1007_BF00370475 20014958 |
GroupedDBID | -~C .86 .VR 06D 0R~ 123 1N0 1SB 2.D 203 28- 29Q 2JN 2JY 2KM 2VQ 30V 4.4 40D 5QI 5VS 67Z 6NX 8UJ 95. 95~ 96X AAAVM AACJB AAHNG AAIAL AAJBT AANTL AAWIL AAYZH ABAWQ ABBBX ABBHK ABECU ABFAN ABJNI ABJOX ABKTR ABMNI ABMQK ABNWP ABQDR ABQSL ABSXP ABXSQ ABYWD ACBXY ACDIW ACGFS ACHJO ACHXU ACMTB ACTMH ADHKG ADIMF ADMHG ADODI ADULT AEFIE AEJRE AEKMD AELLO AENEX AEUPB AFBBN AFEXP AFFNX AFLOW AFVYC AGGDS AGLNM AGQPQ AIHAF AITGF AJZVZ AKBRZ ALMA_UNASSIGNED_HOLDINGS ALRMG ALWAN AMKLP AMVHM ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN B-. BBWZM BDATZ CS3 DL5 DQDLB DSRWC DU5 EBS ECEWR EJD EN8 ESBYG FEDTE FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GIFXF GJIRD GQ7 GQ8 GXS HG5 HG6 HMJXF HQ6 HRMNR HVGLF HZ~ I09 IPSME ITM IXC IZIGR I~X I~Z J-C J0Z JAA JAAYA JBMMH JBSCW JBZCM JCJTX JENOY JHFFW JKQEH JLEZI JLXEF JMS JPL JST KOV KOW LAK M4Y MA- N2Q N9A NB0 NDZJH NU0 O9- O93 O9G O9I P19 P2P P9Q PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S26 S27 S28 S3B SA0 SAP SCLPG SDA SDH SDM SHS SNPRN SOHCF SOJ SRMVM STPWE SZN T13 T16 TN5 TSG TSK TSV U2A VC2 W23 W48 WH7 Y2W Z45 ZWUKE ZY4 ~EX -Y2 0VY 2J2 2KG 2LR 2P1 2~H 406 408 409 40E 8TC 95- AABHQ AACDK AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAYIU AAYQN AAYTO AAYXX ABAKF ABBRH ABDBE ABDZT ABFSG ABFTV ABHLI ABHQN ABKCH ABQBU ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACDTI ACHSB ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFDZB AFGCZ AFHIU AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AIXLP AJBLW AJRNO AMXSW AMYLF AMYQR AOCGG ATHPR AYFIA BA0 BGNMA BSONS CAG CITATION COF CSCUP DDRTE DNIVK DPUIP EBLON EIOEI FERAY GNWQR H13 HF~ HQYDN H~9 IHE IJ- IKXTQ IWAJR IZQ JZLTJ KDC LLZTM NPVJJ NQJWS OAM OVD RIG RZC RZD S16 S1Z SHX SISQX SJYHP SNE SNX SPISZ SSLCW TEORI TUC UG4 UOJIU UTJUX UZXMN VFIZW WK8 YLTOR ZMTXR HFIND IOIBA K30 PAAUG PAWHS PAWZZ PAXOH PBHAV PBQSW PBYQZ PCIWU PCMID PCZJX PDGRG PDWWI PETMR PFVGT PGXDX PIHIL PISVA PJCTQ PJTMS PLCHJ PMHAD PNQDJ POUND PPLAD PQAPC PQCAN PQCMW PQEME PQHKH PQMID PQNCT PQNET PQSCT PQSET PSVJG PVMQY PZGFC |
ID | FETCH-LOGICAL-c196t-fc12c8d28f3d4bdaad8279d4618f2d394284f5b637aabd8029b5ccf10a67a8563 |
ISSN | 0039-3215 |
IngestDate | Fri Jul 25 05:42:05 EDT 2025 Thu Apr 24 23:08:16 EDT 2025 Tue Jul 01 04:17:31 EDT 2025 Thu May 29 08:43:44 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Language | English |
License | http://www.springer.com/tdm |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c196t-fc12c8d28f3d4bdaad8279d4618f2d394284f5b637aabd8029b5ccf10a67a8563 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
PQID | 1299955964 |
PQPubID | 1818735 |
PageCount | 17 |
ParticipantIDs | proquest_journals_1299955964 crossref_citationtrail_10_1007_BF00370475 crossref_primary_10_1007_BF00370475 jstor_primary_20014958 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 1900 |
PublicationDate | 19790101 |
PublicationDateYYYYMMDD | 1979-01-01 |
PublicationDate_xml | – month: 01 year: 1979 text: 19790101 day: 01 |
PublicationDecade | 1970 |
PublicationPlace | Wroclaw, Poland |
PublicationPlace_xml | – name: Wroclaw, Poland |
PublicationTitle | Studia logica |
PublicationYear | 1979 |
Publisher | Ossolineum and North-Holland Ossolineum |
Publisher_xml | – name: Ossolineum and North-Holland – name: Ossolineum |
References | P. Suppes (CR5) 1979 P. Suppes (CR3) 1973 P. Suppes (CR2) 1960 J. E. Hopcroft (CR1) 1969 P. Suppes (CR4) 1976; 117?118 P. Suppes (CR6) 1978 |
References_xml | – volume: 117?118 start-page: 243 year: 1976 ident: CR4 publication-title: Revue Internationale de Philosophie – volume-title: Essays in Honour of Jaakko Hintikka year: 1979 ident: CR5 – volume-title: Children's Language (Vol. 1) year: 1978 ident: CR6 – volume-title: Axiomatic Set Theory year: 1960 ident: CR2 – volume-title: Approaches to Natural Language year: 1973 ident: CR3 – volume-title: Formal Languages and Their Relation to Automata year: 1969 ident: CR1 |
SSID | ssj0002699 |
Score | 1.2314262 |
Snippet | The perfect fit of syntactic derivability and logical consequence in first-order logic is one of the most celebrated facts of modern logic. In the present... |
SourceID | proquest crossref jstor |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 375 |
SubjectTerms | Inference Noun phrases Rules of inference Semantic analysis Semantic models Semantics Sentences Syllogisms Vegetables Verb phrases |
Title | Logical Inference in English: A Preliminary Analysis |
URI | https://www.jstor.org/stable/20014958 https://www.proquest.com/docview/1299955964 |
Volume | 38 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA4-LnoQn7i-KOhFpNImaZN42xVFRMWDgrclaRIQZV1214P-eidN-ljXg3opoSSB5ku-mSaZbxA6Uhp8WixtrMA2xVSmWSzBUMe5VMJYxjObuEDh27v86pFeP2VPTWrEMrpkok6Lzx_jSv6DKrwDXF2U7B-QrTuFF1AGfOEJCMPzVxjfBN56rqL23O5FCMz1IefDkXkt83aNnM6S1x9p-6PlNUJ54gmwOSAaDtsC_i_N1kAqmGhtDQS6IyIm2MdLnprAcMxRYDgMCRRIeAtq2uIzwrKWaSQ-sdYM6ybVXfKEsIRWTdrS1t9MTn0RsBJNbtrOo0XMmDtxX-xe9np3tVnFufD_MuGbprVmQ-sp78JfMJ0xsqXn8LCKVoLLH3U9fmtozgzW0fJtrZc7XkdL91VGiY8NRAOsUQ0rlKIA61nUjVqgRhWom-jx8uLh_CoOyS3iAkhvEtsixQXXmFuiqdJSao6Z0DRPucWaCFhC1GYqJ0xKpXmChcqKwqaJzJnkWU620MLgbWC2UQRrS2tlFVTllJJEgYGjXDrCxgYb00HH1aD0i6D87hKQvPZnh7-DDuu6Q6938mOtrXJs6yrY_2rzDtqrBrsfFsq4Dy6lcEKHOd35Ve-7aKmZzXtoYTJ6N_vg-k3UQZgUXzr-U14 |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Logical+inference+in+English%3A+A+preliminary+analysis&rft.jtitle=Studia+logica&rft.au=Suppes%2C+Patrick&rft.date=1979-01-01&rft.issn=0039-3215&rft.eissn=1572-8730&rft.volume=38&rft.issue=4&rft.spage=375&rft.epage=391&rft_id=info:doi/10.1007%2FBF00370475&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_BF00370475 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0039-3215&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0039-3215&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0039-3215&client=summon |