On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	LFCS (2020 : Deerfield Beach, Fla.) Logical Foundations of Computer Science
1. Verfasser:	Lyon, Tim (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2020
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory	2020	Forster, Yannick
Feedback Hyperjump	2020	Lubarsky, Robert S.
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents	2020	Lyon, Tim
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems	2020	Lyon, Tim
Tracking Computability of GPAC-Generable Functions	2020	Poças, Diogo
Modal Type Theory Based on the Intuitionistic Modal Logic IEL-	2020	Rogozin, Daniel
Computability of Algebraic and Definable Closure	2020	Ackerman, Nathanael
Belief Expansion in Subset Models	2020	Lehmann, Eveline
Knowledge of Uncertain Worlds: Programming with Logical Constraints	2020	Liu, Yanhong A.
Finitism, Imperative Programs and Primitive Recursion	2020	Leivant, Daniel
A Globally Sound Analytic Calculus for Henkin Quantifiers	2020	Baaz, Matthias
Parameterised Complexity of Abduction in Schaefer's Framework	2020	Mahmood, Yasir
Observable Models	2020	Artemov, Sergei
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction	2020	Willard, Dan E.
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics	2020	Dalmonte, Tiziano
On the Constructive Truth and Falsity in Peano Arithmetic	2020	Kushida, Hirohiko
Lifting Recursive Counterexamples to Higher-Order Arithmetic	2020	Sanders, Sam