(Enter summary)
Abstract: The intended meaning of intuitionistic logic is explained by the Brouwer-Heyting-Kolmogorov (BHK) provability semantics which informally defines intuitionistic truth as provability and specifies the intuitionistic connectives via operations on proofs. The problem of finding an adequate formalization of the provability semantics and establishing the completeness of the intuitionistic logic Int was first raised by Gödel in 1933. This question turned out to be a part of the more general problem of ... (Update)
Cited by: More
Re ective -calculus Jesse Alt - Sergei Artemov August
(Correct)
Reflection and Propositions-as-Types - Artemov, Barzilay, Constable, Nogin
(Correct)
Similar documents (at the sentence level): More
36.1%: Explicit Provability: The Intended Semantics for Intuitionistic.. - Artemov (1998)
(Correct)
10.6%: Logic of Proofs: a Unified Semantics for Modality and lambda-Terms - Artemov (1998)
(Correct)
7.0%: Operations on Proofs That Can Be Specified By Means of Modal Logic - Artemov
(Correct)
Active bibliography (related documents): More All
1.1: Explicit Provability And Constructive Semantics - Artemov (2001)
(Correct)
0.5: Gödel's Dialectica interpretation and its two-way stretch - Feferman (1997)
(Correct)
0.3: On Epistemic Logic with Justification - Sergei Artemov Elena
(Correct)
Similar documents based on text: More All
0.6: Operational Modal Logic - Artemov (1995)
(Correct)
0.4: Proof Realizations of Typed lambda-Calculi - Artemov (1997)
(Correct)
0.4: Proof Realization of Intuitionistic and Modal Logics - Artemov (1996)
(Correct)
Related documents from co-citation: More All
2: Basic Proof Theory (context) - Troelstra, Schwichtenberg - 1996
2: The Bulletin for Symbolic Logic (context) - Artemov, constructive - 2001
2: The logic of provability
- Japaridze, de Jongh - 1998
BibTeX entry: (Update)
S. Artemov. Uniform provability realization of intuitionistic logic, modality and lambda-terms. Electronic Notes on Theoretical Computer Science, 23(1), 1999. http://www.elsevier.nl/entcs/. http://citeseer.ist.psu.edu/artemov99uniform.html More
@misc{ artemov99uniform,
author = "S. Artemov",
title = "Uniform provability realization of intuitionistic logic",
text = "S. Artemov. Uniform provability realization of intuitionistic logic, modality
and lambda-terms. Electronic Notes on Theoretical Computer Science, 23(1),
1999. http://www.elsevier.nl/entcs/.",
year = "1999",
url = "citeseer.ist.psu.edu/artemov99uniform.html" }
Citations (may not include all citations):
143
Logic of Programs (context) - Kozen, Tiuryn - 1990 ACM
112
Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
88
Basic Proof Theory (context) - Troelstra, Schwichtenberg - 1996 ACM
44
the interpretation of intuitionistic number theory (context) - Kleene - 1945
23
Mathematical Logic (context) - Kreisel - 1965
22
Die formalen Regeln der intuitionistischen Logik (context) - Heyting - 1930
22
Some theorems about the sentential calculi of Lewis and Heyt.. (context) - McKinsey, Tarski - 1948 DBLP
16
Logic of Provability
- de Jongh, Japaridze - 1998
14
Operational Modal Logic
- Artemov - 1995
10
Eine Interpretation des intuitionistischen Aussagenkalkuls (context) - odel - 1933
6
The intended interpretation of intuitionistic logic (context) - Weinstein - 1983
4
About my papers on intuitionistic logic (context) - Kolmogorov - 1985
4
Zur Deutung der intuitionistischen Logik (context) - Kolmogoro - 1932
4
Electronic Notes in Computer Science
- Pfenning, Wong et al. - 1995
2
A semantical proof of De Jongh's theorem (context) - van Osten - 1991
2
A theory of constructions equivalent to arithmetic (context) - Goodman - 1970
1
Logic of Proofs: a Unied Semantics for Modality and -terms (context) - Artemov - 1998
1
Unied Semantics for Modality and -terms via Proof Polynomia.. (context) - Artemov - 1999
Documents on the same site (http://www.math.cornell.edu/~artemov/publ.html): More
Deep Isomorphism of Modal Derivations and λ-Terms - Artemov (1999)
(Correct)
Logic of Proofs: a Unified Semantics for Modality and lambda-Terms - Artemov (1998)
(Correct)
Proof Realizations of Typed lambda-Calculi - Artemov (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC