Branden Fitelson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2026

Applying Saturation-Based Theorem Proving to Open Problems in Positive Implicational LogicBranden Fitelson, Nicolas Peltier. JAR, 70(1):5, June 2026. [doi]

2025

Univocity of intuitionistic and Classical ConnectivesRodolfo C. Ertola-Biraben, Branden Fitelson. bsl, 31(3):488-497, 2025. [doi]

2017

Declarations of independenceBranden Fitelson, Alan Hájek. synthese, 194(10):3979-3995, 2017. [doi]

2016

Solutions to Some Open Problems from SlaneyBranden Fitelson. auasjlog, 13(4):78-88, 2016. [doi]

2015

Remarks on "Random Sequences"Branden Fitelson, Daniel N. Osherson. auasjlog, 12(1), 2015. [doi]

2013

Gibbard's Collapse Theorem for the Indicative Conditional: An Axiomatic ApproachBranden Fitelson. BIRTHDAY 2013: 181-188 [doi]

2012

Introduction to the Special Issue: Probability, Confirmation and FallaciesJeanne Peijnenburg, Branden Fitelson, Igor Douven. synthese, 184(1):1, 2012. [doi]

Updating: Learning versus supposingJiaying Zhao, Vincenzo Crupi, Katya Tentori, Branden Fitelson, Daniel N. Osherson. cogsci 2012: [doi]

2010

FEW 2009 Special Issue: PrefaceBranden Fitelson. jphil, 39(6):591, 2010. [doi]

2008

Goodman's "New Riddle"Branden Fitelson. jphil, 37(6):613-643, 2008. [doi]

Bayesians sometimes cannot ignore even very implausible theories (even ones that have not yet been thought of)Branden Fitelson, Neil Thomason. auasjlog, 6, 2008. [doi]

A Decision procedure for Probability Calculus with ApplicationsBranden Fitelson. rsl, 1(1):111-125, 2008. [doi]

2007

Likelihoodism, Bayesianism, and relational confirmationBranden Fitelson. synthese, 156(3):473-489, 2007. [doi]

IntroductionBranden Fitelson. sLogica, 86(2):147-148, 2007. [doi]

Steps Toward a Computational MetaphysicsBranden Fitelson, Edward N. Zalta. jphil, 36(2):227-247, 2007. [doi]

IntroductionBranden Fitelson. sLogica, 86(3):351-352, 2007. [doi]

2002

Shortest Axiomatizations of Implicational S4 and S5Zachary Ernst, Branden Fitelson, Kenneth Harris, Larry Wos. ndjfl, 43(3):169-179, 2002.

Short Single Axioms for Boolean AlgebraWilliam McCune, Robert Veroff, Branden Fitelson, Kenneth Harris, Andrew Feist, Larry Wos. JAR, 29(1):1-16, 2002.

Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential CalculusLarry Wos, Dolph Ulrich, Branden Fitelson. JAR, 29(2):107-124, 2002.

2001

Missing Proofs FoundBranden Fitelson, Larry Wos. JAR, 27(2):201-225, 2001.

Finding Missing Proofs with Automated ReasoningBranden Fitelson, Larry Wos. sLogica, 68(3):329-356, 2001.

Comments on Some Completeness Theorems of Urquhart and Méndez & SaltoKenneth Harris, Branden Fitelson. jphil, 30(1):51-55, 2001. [doi]

Distributivity in [Lstrok][aleph]0 and Other Sentential LogicsKenneth Harris, Branden Fitelson. JAR, 27(2):141-156, 2001.

2000

Automating the Search for Answers to Open QuestionsLarry Wos, Branden Fitelson. tphol 2000: 519-525

Sign in or sign up to see more results.

runs on WebDSL