A Constructive Logic with Classical Proofs and Refutations

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some sense, whereas proofs of classical propositions pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science S. 1 - 13
Hauptverfasser: Barenbaum, Pablo, Freund, Teodoro
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 29.06.2021
Schlagworte:
Calculus
Cognition
Computational modeling
Computer science
Encoding
Focusing
Semantics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some sense, whereas proofs of classical propositions proceed by contradiction. The system, in natural deduction style, is shown to be sound and complete with respect to a Kripke semantics. We develop the system from the perspective of the propositions-as-types correspondence by deriving a term assignment system with confluent reduction. The proof of strong normalization relies on a translation to System F with Mendler-style recursion.
AbstractList We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some sense, whereas proofs of classical propositions proceed by contradiction. The system, in natural deduction style, is shown to be sound and complete with respect to a Kripke semantics. We develop the system from the perspective of the propositions-as-types correspondence by deriving a term assignment system with confluent reduction. The proof of strong normalization relies on a translation to System F with Mendler-style recursion.
Author Freund, Teodoro
Barenbaum, Pablo
Author_xml – sequence: 1
  givenname: Pablo
  surname: Barenbaum
  fullname: Barenbaum, Pablo
  email: pbarenbaum@dc.uba.ar
  organization: Universidad de Buenos Aires,Facultad de Ciencias Exactas y Naturales,Departamento de Computatión,Argentina
– sequence: 2
  givenname: Teodoro
  surname: Freund
  fullname: Freund, Teodoro
  email: tfreund95@gmail.com
  organization: Universidad de Buenos Aires,Facultad de Ciencias Exactas y Naturales,Departamento de Computatión,Argentina
BookMark eNotj8tKxDAUQCMoqGO_QJD8QMebZxN3Q9FxoKD4WA_X5kYjtZUmo_j3Cs7qrM6Bc8oOx2kkxi4ELIUAf9lt2kcjpdVLCVIsvW7Aan_AKt84Ya3R2nljj1mV8zsASNcI0P6EXa14O425zLu-pC_i3fSaev6dyhtvB8w59Tjw-3maYuY4Bv5AcVewpD_njB1FHDJVey7Y8831U3tbd3frTbvqapTClzoIoZxpQLgQPJF5acApBJQhBIikIgTpjECi0ACaPgRlncFITrmIWqoFO__vJiLafs7pA-ef7f5Q_QJlrkln
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470649
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665448956
1665448954
EndPage 13
ExternalDocumentID 9470649
Genre orig-research
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a219t-d113857018dd9ee5b7083a0a2ddd0fe3f0d2851aeed70a5cdd3685afe838fa423
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:26:38 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a219t-d113857018dd9ee5b7083a0a2ddd0fe3f0d2851aeed70a5cdd3685afe838fa423
PageCount 13
ParticipantIDs ieee_primary_9470649
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.1488178
Snippet We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Calculus
Cognition
Computational modeling
Computer science
Encoding
Focusing
Semantics
Title A Constructive Logic with Classical Proofs and Refutations
URI https://ieeexplore.ieee.org/document/9470649
WOSCitedRecordID wos000947350400057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4sFT1VZ8k4NH02aT3SbrTYpFQUrxAb2VbDIBL1uxj99vZnetCF68hUBeE5L5MpmZD-DaBSWKUVFwh6ni8SQabpLguFDGSZVZgWmoyCb0dGrm83zWgptdLAwiVs5nOKBi9Zfvl25DprJhnuqoQfM2tLXWdazWzp5CyD-i3SYIOBH58Olx_ELogiwnMhk0jX-xqFRKZNL93_AH0P-JxmOznZ45hBaWR9D9pmNgzenswe0dI_rNOiHsFhnRKDtGhlZWUV_SdlBHUe0xW3r2jGFTf8Sv-vA2uX8dP_CGGoHbeMWsuU8SRanpE-N9jpgVOkIpK6z03ouAKggvI5aycWZa2Mx5T4nmbUCjTLARQh1Dp1yWeAIsYj40o5GV8WmTogxFxIw-1QrjXaizLDuFHoli8VFnv1g0Ujj7u_oc9kna5Ewl8wvoxDXjJey57fp99XlVbdkXelSXAA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfRUtRXf5uDRbbPJbjfrTYqlxVqKVuitZJMJeNmKffx-M7trRfDiLQQSJhMy82WSmQ_g1jjJs26WBQYjGfiTqAIVOhNwqYyQseYYuYJsIhmP1WyWTmpwt82FQcTi8xm2qVm85duFWVOorJNGifeg6Q7sxlEkwjJbaxtRIezv8W6VBhzytDMa9l4JX1DsRITtavgvHpXCjfQb_xPgEFo_-XhssvU0R1DD_Bga34QMrDqfTbh_YETAWZaE3SAjImXDKNTKCvJL2hCayDs-pnPLXtCty6f4ZQve-o_T3iCoyBEC7Y3MKrBhKKk4faisTRHjLPFgSnMtrLXcoXTcCo-mtJcs4To21lKpee1QSeW0B1EnUM8XOZ4C86gPVberhb_cRChc5lGjjRKJ3homcRyfQZNUMf8o61_MKy2c_919A_uD6fNoPhqOny7ggDRPX6tEegl1v368gj2zWb0vP6-L7fsChweaRw
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%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=A+Constructive+Logic+with+Classical+Proofs+and+Refutations&rft.au=Barenbaum%2C+Pablo&rft.au=Freund%2C+Teodoro&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470649&rft.externalDocID=9470649