×

Found 2,000 Documents (Results 1–100)

100
MathJax

A formally verified cut-elimination procedure for linear nested sequents for tense logic. (English) Zbl 07532522

Das, Anupam (ed.) et al., Automated reasoning with analytic tableaux and related methods. 30th international conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12842, 281-298 (2021).
MSC:  68V15
PDF BibTeX XML Cite
Full Text: DOI

Basing sequent systems on exclusive-or. (English) Zbl 07532512

Das, Anupam (ed.) et al., Automated reasoning with analytic tableaux and related methods. 30th international conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12842, 112-128 (2021).
MSC:  68V15
PDF BibTeX XML Cite
Full Text: DOI

A fresh view of linear logic as a logical framework. (English) Zbl 07313969

Nalon, Cláudia (ed.) et al., Proceedings of the 15th international workshop on logical and semantic frameworks, with applications, LSFA 2020, virtual workshop, August 27–28, 2020. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 351, 143-165 (2020).
MSC:  03B70 68Q55 68T27
PDF BibTeX XML Cite
Full Text: DOI

Logic beyond formulas: a proof system on graphs. (English) Zbl 07299457

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 38-52 (2020).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

On deriving nested calculi for intuitionistic logics from semantic systems. (English) Zbl 1485.03021

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11972, 177-194 (2020).
MSC:  03B20 03F03 03F05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Syntactic cut-elimination for intuitionistic fuzzy logic via linear nested sequents. (English) Zbl 1481.03009

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11972, 156-176 (2020).
MSC:  03B52 03F05
PDF BibTeX XML Cite
Full Text: DOI arXiv

A globally sound analytic calculus for Henkin quantifiers. (English) Zbl 1485.03140

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11972, 128-143 (2020).
MSC:  03C80 03F03 03F05
PDF BibTeX XML Cite
Full Text: DOI

Countermodel construction via optimal hypersequent calculi for non-normal modal logics. (English) Zbl 1485.03048

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11972, 27-46 (2020).
MSC:  03B45 03F05
PDF BibTeX XML Cite
Full Text: DOI Link

Proof nets, coends and the Yoneda isomorphism. (English) Zbl 07450007

Ehrhard, Thomas (ed.) et al., Proceedings of the joint international workshop on linearity & trends in linear logic and applications, Linearity-TLLA 2018, Oxford, UK, July 7–8, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 292, 148-167 (2019).
MSC:  03F52 03F05 03G30
PDF BibTeX XML Cite
Full Text: arXiv Link

Point-free spectra of linear spreads. (English) Zbl 1476.03078

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 353-374 (2019).
PDF BibTeX XML Cite
Full Text: DOI

Analytic equational proof systems for combinatory logic and \(\lambda \)-calculus: a survey. (English) Zbl 1469.03042

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 235-253 (2019).
MSC:  03B40 03F05
PDF BibTeX XML Cite
Full Text: DOI

Through an inference rule, darkly. (English) Zbl 1469.03158

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 131-158 (2019).
PDF BibTeX XML Cite
Full Text: DOI

Combining monotone and normal modal logic in nested sequents – with countermodels. (English) Zbl 1468.03023

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 203-220 (2019).
MSC:  03B45 03F05 03F03
PDF BibTeX XML Cite
Full Text: DOI

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents. (English) Zbl 1435.03084

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 185-202 (2019).
MSC:  03F05 03B45 03B44
PDF BibTeX XML Cite
Full Text: DOI arXiv

A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic. (English) Zbl 1435.68367

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 111-129 (2019).
MSC:  68V15 03B20 03F05
PDF BibTeX XML Cite
Full Text: DOI

Bounded sequent calculi for non-classical logics via hypersequents. (English) Zbl 1468.03021

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 94-110 (2019).
PDF BibTeX XML Cite
Full Text: DOI

First-order quasi-canonical proof systems. (English) Zbl 1435.03085

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 77-93 (2019).
PDF BibTeX XML Cite
Full Text: DOI

Cut elimination for the weak modal Grzegorczyk logic via non-well-founded proofs. (English) Zbl 07176948

Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 569-583 (2019).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

Note on globally sound analytic calculi for quantifier macros. (English) Zbl 07176943

Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 486-497 (2019).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Database

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software