Logical Foundations of Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030367541, 9783030367558

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Belief Expansion in Subset Models

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_6 ◽

2019 ◽

pp. 85-97 ◽

Cited By ~ 1

Author(s):

Eveline Lehmann ◽

Thomas Studer

Tracking Computability of GPAC-Generable Functions

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_14 ◽

2019 ◽

pp. 214-235

Author(s):

Diogo Poças ◽

Jeffery Zucker

On the Constructive Truth and Falsity in Peano Arithmetic

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_5 ◽

2019 ◽

pp. 75-84

Author(s):

Hirohiko Kushida

Keyword(s):

Peano Arithmetic

Finitism, Imperative Programs and Primitive Recursion

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_7 ◽

2019 ◽

pp. 98-110

Author(s):

Daniel Leivant

Keyword(s):

Primitive Recursion

Modal Type Theory Based on the Intuitionistic Modal Logic $$\mathbf{IEL}^{-}$$

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_15 ◽

2019 ◽

pp. 236-248

Author(s):

Daniel Rogozin

Keyword(s):

Modal Logic ◽

Type Theory ◽

Intuitionistic Modal Logic ◽

Modal Type

On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_12 ◽

2019 ◽

pp. 177-194 ◽

Cited By ~ 2

Author(s):

Tim Lyon

Keyword(s):

Intuitionistic Logics

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_4 ◽

2019 ◽

pp. 47-74

Author(s):

Yannick Forster ◽

Dominik Kirst ◽

Dominik Wehr

Keyword(s):

Type Theory ◽

Order Logic ◽

First Order Logic ◽

First Order ◽

Constructive Type Theory ◽

Constructive Type ◽

Completeness Theorems

Lifting Recursive Counterexamples to Higher-Order Arithmetic

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_16 ◽

2019 ◽

pp. 249-267

Author(s):

Sam Sanders

Keyword(s):

Higher Order ◽

Order Arithmetic

A Globally Sound Analytic Calculus for Henkin Quantifiers

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_9 ◽

2019 ◽

pp. 128-143

Author(s):

Matthias Baaz ◽

Anela Lolic

Keyword(s):

Henkin Quantifiers

Observable Models

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-030-36755-8_2 ◽

2019 ◽

pp. 12-26 ◽

Cited By ~ 2

Author(s):

Sergei Artemov

Logical Foundations of Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Belief Expansion in Subset Models

Tracking Computability of GPAC-Generable Functions

On the Constructive Truth and Falsity in Peano Arithmetic

Finitism, Imperative Programs and Primitive Recursion

Modal Type Theory Based on the Intuitionistic Modal Logic $$\mathbf{IEL}^{-}$$

On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory

Lifting Recursive Counterexamples to Higher-Order Arithmetic

A Globally Sound Analytic Calculus for Henkin Quantifiers

Observable Models

Logical Foundations of Computer Science - Lecture Notes in Computer Science
Latest Publications