default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBranden Fitelson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j16]Branden Fitelson, Alan Hájek
:
Declarations of independence. Synth. 194(10): 3979-3995 (2017)- 2013
- [c3]Branden Fitelson:
Gibbard's Collapse Theorem for the Indicative Conditional: An Axiomatic Approach. Automated Reasoning and Mathematics 2013: 181-188 - 2012
- [j15]Jeanne Peijnenburg, Branden Fitelson, Igor Douven:
Introduction to the Special Issue: Probability, Confirmation and Fallacies. Synth. 184(1): 1 (2012) - [c2]Jiaying Zhao, Vincenzo Crupi, Katya Tentori, Branden Fitelson, Daniel N. Osherson:
Updating: Learning versus supposing. CogSci 2012 - [i3]Branden Fitelson, Daniel N. Osherson:
Remarks on "Random Sequences". CoRR abs/1205.5865 (2012) - 2010
- [j14]Branden Fitelson:
FEW 2009 Special Issue: Preface. J. Philos. Log. 39(6): 591 (2010)
2000 – 2009
- 2008
- [j13]Branden Fitelson:
Goodman's "New Riddle". J. Philos. Log. 37(6): 613-643 (2008) - [j12]Branden Fitelson:
A Decision procedure for Probability Calculus with Applications. Rev. Symb. Log. 1(1): 111-125 (2008) - 2007
- [j11]Branden Fitelson, Edward N. Zalta:
Steps Toward a Computational Metaphysics. J. Philos. Log. 36(2): 227-247 (2007) - [j10]Branden Fitelson:
Introduction. Stud Logica 86(2): 147-148 (2007) - [j9]Branden Fitelson:
Introduction. Stud Logica 86(3): 351-352 (2007) - [j8]Branden Fitelson:
Likelihoodism, Bayesianism, and relational confirmation. Synth. 156(3): 473-489 (2007) - 2002
- [j7]William McCune, Robert Veroff, Branden Fitelson, Kenneth Harris, Andrew Feist, Larry Wos:
Short Single Axioms for Boolean Algebra. J. Autom. Reason. 29(1): 1-16 (2002) - [j6]Larry Wos, Dolph Ulrich, Branden Fitelson:
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. J. Autom. Reason. 29(2): 107-124 (2002) - [j5]Zachary Ernst, Branden Fitelson, Kenneth Harris, Larry Wos:
Shortest Axiomatizations of Implicational S4 and S5. Notre Dame J. Formal Log. 43(3): 169-179 (2002) - [i2]Larry Wos, Dolph Ulrich, Branden Fitelson:
Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. CoRR cs.LO/0211014 (2002) - [i1]Larry Wos, Dolph Ulrich, Branden Fitelson:
XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus. CoRR cs.LO/0211015 (2002) - 2001
- [j4]Kenneth Harris, Branden Fitelson:
Distributivity in [Lstrok][aleph]0 and Other Sentential Logics. J. Autom. Reason. 27(2): 141-156 (2001) - [j3]Branden Fitelson, Larry Wos:
Missing Proofs Found. J. Autom. Reason. 27(2): 201-225 (2001) - [j2]Kenneth Harris, Branden Fitelson:
Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. J. Philos. Log. 30(1): 51-55 (2001) - [j1]Branden Fitelson, Larry Wos:
Finding Missing Proofs with Automated Reasoning. Stud Logica 68(3): 329-356 (2001) - 2000
- [c1]Larry Wos, Branden Fitelson:
Automating the Search for Answers to Open Questions. TPHOLs 2000: 519-525
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-05-02 21:45 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:
