default search action
George Boolos
Person information
- affiliation: Massachusetts Institute of Technology
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
- [j23]George Boolos:
Constructing Cantorian counterexamples. J. Philos. Log. 26(3): 237-239 (1997) - 1995
- [j22]Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser:
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. Ann. Pure Appl. Log. 75(1-2): 1 (1995) - [j21]George Boolos:
Frege's theorem and the Peano postulates. Bull. Symb. Log. 1(3): 317-326 (1995) - 1993
- [j20]George Boolos:
The Analytical Completeness of Dzhaparidze's Polymodal Logics. Ann. Pure Appl. Log. 61(1-2): 95-111 (1993) - 1991
- [j19]George Boolos, Giovanni Sambin:
Provability: the emergence of a mathematical modality. Stud Logica 50(1): 1-23 (1991)
1980 – 1989
- 1988
- [j18]George Boolos:
Alphabetical order. Notre Dame J. Formal Log. 29(2): 214-215 (1988) - 1987
- [b2]George Boolos, Richard C. Jeffrey:
Computability and logic (2. ed.). Cambridge University Press 1987, ISBN 978-0-521-29967-1, pp. I-X, 1-285 - [j17]George Boolos:
A curious inference. J. Philos. Log. 16(1): 1-12 (1987) - [j16]George Boolos, Vann McGee:
The Degree of the Set of Sentences of Predicate Provability Logic that are True Under Every Interpretation. J. Symb. Log. 52(1): 165-171 (1987) - 1985
- [j15]George Boolos, Giovanni Sambin:
An incomplete system of modal logic. J. Philos. Log. 14(4): 351-358 (1985) - [j14]George Boolos:
1-consistency and the diamond. Notre Dame J. Formal Log. 26(4): 341-347 (1985) - 1984
- [j13]George Boolos:
Don't eliminate cut. J. Philos. Log. 13(4): 373-378 (1984) - [j12]George Boolos, Sy D. Friedman:
Annual Meeting of the Association for Symbolic Logic: Boston 1983. J. Symb. Log. 49(4): 1441-1449 (1984) - [j11]George Boolos:
Trees and finite satisfiability: proof of a conjecture of Burgess. Notre Dame J. Formal Log. 25(3): 193-197 (1984) - 1982
- [j10]George Boolos:
Extremely Undecidable Sentences. J. Symb. Log. 47(1): 191-196 (1982) - [j9]George Boolos:
On the Nonexistence of Certain Normal Forms in the Logic of Provability. J. Symb. Log. 47(3): 638-640 (1982) - 1981
- [j8]George Boolos, Sy D. Friedman, Harold Hodes:
Meeting of the Association for Symbolic Logic: New York 1979. J. Symb. Log. 46(2): 427-434 (1981) - 1980
- [j7]George Boolos:
Provability, truth, and modal logic. J. Philos. Log. 9(1): 1-7 (1980)
1970 – 1979
- 1979
- [j6]George Boolos:
Reflection Principles and Iterated Consistency Assertions. J. Symb. Log. 44(1): 33-35 (1979) - 1977
- [j5]George Boolos:
On Deciding the Provability of Certain Fixed Point Statements. J. Symb. Log. 42(2): 191-193 (1977) - 1976
- [j4]George Boolos:
On Deciding the Truth of Certain Statements Involving the Notion of Consistency. J. Symb. Log. 41(4): 779-781 (1976) - 1975
- [j3]George Stephen Boolos:
On Kalmar's consistency proof and a generalization of the notion of ω-consistency. Arch. Math. Log. 17(1-2): 3-7 (1975) - 1974
- [b1]George Boolos, Richard C. Jeffrey:
Computability and logic. Cambridge Univ. Press 1974, ISBN 052120402X, pp. I-X, 1-262 - 1970
- [j2]George Boolos:
A proof of the Löwenheim-Skolem theorem. Notre Dame J. Formal Log. 11(1): 76-78 (1970)
1960 – 1969
- 1968
- [j1]George Boolos, Hilary Putnam:
Degrees of Unsolvability of Constructible Sets of Integers. J. Symb. Log. 33(4): 497-513 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: