Technical Reports
2009
| 183 | Peter Spirtes | A Tutorial On Causal Inference |
| 182 | Rory Smead and Kevin Zollman | The Stability of Strategic Plasticity |
2008
| 181 | Steve Kieffer, Jeremy Avigad, and Harvey Friedman | A language for mathematical knowledge management |
2007
| 180 | Steve Awodey and Kohei Kishida | Topology and Modality: The Topological Interpretation of First-Order Modal Logic |
2006
| 179 | Jeremy Avigad | A variant of the double-negation translation |
| 178 | Wilfried Sieg | Church Without Dogma: Axioms for Computability |
| 177 | Joseph Ramsey | A PC-Style Markov Blanket for High Dimensional Datasets |
2005
2004
| 163 | Jeremy Avigad | Notes on a Formalization of the Prime Number Theorem |
| 162 | Jeremy Avigad | Dedekind's 1871 Version of the Theory of Ideals |
| 161 | Frederick Eberhardt, Clark Glymour, and Richard Scheines | N-1 Experiments Suffice to Determine the Causal Relations Among N Variables |
| 160 | Horacio Arlo-Costa and Issac Levi | Contraction: On the Decision Theoretical Origins of Minimal Change and Entrenchment |
| 159 | Steve Awodey | Book Review: Sketches of an Elephant |
| 158 | Maralee Harrell | The Improvement of Critical Thinking Skills in What Philosophy |
| 157 | David Danks | Psychological Theories of Categorizations as Probabilistic Models |
| 156 | Steve Awodey and Henrik Forssell | Alegebraic Models of Intuitionistic Theories of Sets and Classes |
| 155 | Steve Awodey and Michael A. Warren | Predictive Algebraic Set Theory |
| 154 | Wilfred Sieg and Mark Ravaglia | David Hilbert and Paul Bernays, Grundlagen der Mathematik I and II: A Landmark |
| 153 | Wilfred Sieg and Dirk Schlimm | Dedekind's Analysis of Number: Systems and Axioms |
2003
2002
| 137 | Kevin T. Kelly | A Close Shave with Realism: How Ockham's Razor Helps Us Find The Truth |
| 136 | Steve Awodey and Jonas Eliasson | Ultrasheaves and Double-Negation |
| 135 | Richard Scheines, Gaea Leinhardt, Joel Smith, and Kwangsu Cho | Teaching and Learning with Online Courses |
| 134 | Jeremy Avigad | Number Theory and Elementary Arithmetic |
| 133 | Tianjaou Chu | Sampling, Amplifying, and Resampling |
| 131 | Shane Harwood and Richard Scheines | Genetic Algorithm Search Over Causal Models |
| 130 | Wilfred Sieg and Saverio Cittadini | Normal Natural Deduction Proof (In Non-Classical Logics) |
| 128 | Shane Harwood and Richard Scheines | Learning Linear Causal Structure Equation Models with Genetic Algorithms |
| 127 | Michael Kohlhase and Mandy Simons | Interpreting Negatives in Discourse |
| 126 | Steve Awodey and Jesse Hughes | Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem |
| 125 | Jeremy Avigad | Notes on II-conservativity, w-submodels, and the Collection Schema |
2001
| 124 | Richard Scheines and Joe Ramsey | Simulating Genetic Regulartory Networks |
| 123 | Steve Awodey and A. W. Carus | How Carnap Could Have Replied to Gödel |
| 122 | Steve Awodey and Andrej Bauer | Propositions as {Types} |
| 121 | Wilfred Sieg | Four Introductory Notes |
| 120 | Jeremy Avigad and Erich H. Reck | Clarifying the Nature of The Infinite: The Development of Metamathematics and Proof Theory |
| 119 | Peter Vanderschraaf and Brian Skyrms | Learning to Take Turns |
| 118 | Steve Awodey and Erich H. Reck | Completeness and Categoricity: 19th Century Axiomatics to 21st Century Senatics |
| 117 | Steve Awodey and Audrej Bauer | Sheaf Toposes for Realizability |
2000
| 116 | Steve Awodey | Continuity and Logical Completeness: An Application of Sheaf Theory and Topoi |
| 115 | Jeremey Avigad | Weak Theories of Nonstandard Arithmetic and Analysis |
| 114 | Jeremey Avigad | Update Procedures and the 1-Consistency of Arithmetic |
| 113 | Jeremey Avigad | Eliminating Definitions and Skolem Functions in First-Order Logic |
| 112 | Jeremey Avigad | Saturated Models of Universal Theories |
| 111 | Jeremey Avigad | Algebraic Proofs of Cut Elimination |
| 110 | Jeremey Avigad and Jeffery Helzner | Transfer Principles in Nonstandard Intuitionistic Arithmetic |
| 109 | Steve Awodey and Jeffery Hughes | The Coalegebraic Dual of Birkoff's Variety Theorm |
| 107 | Horacio Arlo-Costa | First Order Extensions of Classical Systems of Modal Logic: The Role of Barcan Schemas |
| 106 | Steve Awodey and A. W. Carus | Carnap Versus Gödel: On Syntax and Tolerance |
| 105 | Wilfried Sieg | Calculations by Man and Machine: Mathematical Presentation |
1999
| 104 | Wilfried Sieg | Calculations by Man and Machine: Conceptual Analysis |
| 103 | Steve Awodey and Lars Birkedal | Elementary Axioms for Local Maps of Toposes |
| 102 | Thomas Richardson and Peter Spirtes | Parameterizing and Scoring Mixed Ancestral Graphs |
| 101 | Kevin Kelly | Naturalism Logicized |
| 100 | Mandy Simons | On The Felicity Conditions of Disjunctive Sentences |
| 99 | S. Awodey, L. Birkendal, and D. Scott | Local Realizability Toposes and a Modal Logic for Computability |
| 98 | Thomas Richardson and Peter Spirtes | Scoring Ancestral Graph Models |
| 97 | James M. Robins, Richard Scheines, Peter Spirtes, and Larry Wasserman | The Limits of Causal Knowledge |
1998
| 95 | Peter Vanderschraaf | Game Theory, Evolution and Justice |
| 94 | Horacio Arlo-Costa | Full Belief, Supposition, and Personal Probablility |
| 92 | S. Awodey and A. W. Carus | Carnap, Completeness, and Categoricity: The Gabelbarkeitssatz of 1928 |
| 91 | Jeremey Avigad | Interpretating Classical Theories in Constructive Ones |
| 90 | Wilfried Sieg | Towards Finitist Proof Thoery |
| 89 | Wilfried Sieg and John Byrnes | An Abstract Model for Parallel Computation: Gandy's Thesis |
| 88 | Kevin Kelly | Iterated Belief Revison, Reliability, and Inductive Amnesia |
| 86 | Jeremey Avigad | A Realiziability Interpretation for Classical Arithmetic |
| 85 | Peter Vanderschraaf | Common Knowledge: Analysis and Applications |
1997
| 84 | Horacio Arlo-Costa | Belief Revision Conditionals: Models of Suppositional Reasoning |
| 82 | Spirtes, Richardson, Meek, Scheines, and Glymour | Using Path Diagrams as a Structural Equation Modelling Tool |
| 81 | S. Awodey and C. Butz | Topological Completeness for Higher-Order Logic |
| 80 | Steve Awodey | Sheaf Representation for Topoi |
| 79 | Wilfried Sieg | Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science |
| 78 | Wilfried Sieg | Hilbert's Program: 1917-1922 |
| 77 | Peter Spirtes | Casual Inference in the Presence of Latent Variables and Selection Bias |
| 76 | Wilfried Sieg and John Byrnes | Gödel, Turing, and K-Graph Machines |
1996
| 75 | Thomas Richardson and Peter Spirtes | Automated Discovery of Linear Feedback Models |
| 74 | Wilfred Sieg and John Byrnes | Normal Natural Deduction Proofs (In Classical Logic) |
| 73 | Christina Bicchieri and Oliver Schulte | Common Reasoning About Admissiblity |
| 72 | P. Spirtes, T. Richardson, C. Meek, R. Scheines, and C. Glymour | Using D-Separation to Calculate Zero Partial Correlations in Linear Models with Correlated Errors |
| 71 | Wilfred Sieg | Proof Theory |
| 70 | Wilfred Sieg and John Byrnes | K-Graph Machines: Generalizing Turing's Machines and Arguments |
| 69 | Peter Spirtes | Discovering Causal Relations Among Latent Variables in Directed Acyclical Graphical Models |
| 68 | Thomas Richardson | Discovering Cyclic Causal Structure |
| 67 | Thomas Richardson | Fast Recalculation of the Covariance Matrix Implied by a Recursive Structural Equation Model |
1995
| 66 | R. Scheines, H. Hoijtink and A. Boomsma | Bayesian Estimation and Testing of Structural Equation Models |
| 65 | Carolyn Penstein-Rosé | The Structure of Multiple-Headed Negotiations |
| 64 | Christopher Meek | Related Graphical Frameworks: Undircted, Directed Acyclic and Chain Graph Models |
| 63 | Thomas Richardson | A Polynomial Algorithm for Deciding Equivalence in Directed Acyclic Graphical Models |
| 62 | Chris Meek | Strong-Completeness and Faithfulness in Belief Networks |
| 61 | Chris Meek | Complete Orientation Rules for Patterns |
1994
1993
| 46 | Alberto Momigliano and Mario Ornaghi | Regular Search Spaces (I): Horn and Normal Clauses |
| 44 | Wilfred Sieg and Barbara Kauffmann | Unification for Quantified Formula |
| 43 | Samuel R. Buss and Aleksandar Ignjatović | Unprovability of Consistency Statements in Fragments of Bounded Arithmetic |
| 42 | Wilfred Sieg | Aspects of Mathematical Experience |
| 41 | Alberto Momigliano | Theorem Proving via Uniform Proofs |
| 40 | Richard Scheines and Wilfred Sieg | An Experimental Comparison of Alternative Proof Construction Environments |
| 39 | Richard Scheines | Unidimensional Linear Latent Variable Models |
| 38 | Cristina Bicchieri | Counterfactuals, Belief Changes, and Equilibrium Refinements |
| 37 | Cristina Bicchieri and Gian Aldo Antonelli | Game-Theoretic Axioms for Local Rationality and Bounded Knowledge |
| 36 | Daniele Mundici and Wilfred Sieg | Mathematics Studies Machines |
| 35 | Peter Spirtes | Directed Cyclic Graphs, Conditional Independence, and Non-Recursive Linear Constructive Equation Models |
1992
| 34 | Aleksandar Ignjatović | Hilbert's Program and The Omega-Rule |
| 33 | Peter Spirtes and Thomas Verma | Equivalence of Causal Models with Latent Variables |
| 32 | P. Spirtes, C. Glymour, R. Scheines, C. Meek, S. Fineberg, E. Slate | Prediction and Experimental Design with Graphical Causal Models |
| 31 | Wilfred Sieg | Effectiveness and Provability |
| 30 | Wilfred Sieg | Mechanisms and Search: Aspects of Proof Theory |
| 29 | Saverio Cittadini | Intercalation Calculus for Intuitionistic Propositional Logic |
| 28 | Kevin T. Kelly, Cory Juhl and Clark Glymour | Reliability, Realism, and Relativism |
| 27 | Kevin T. Kelly | Learning Theory and Descriptive Set Theory |
| 26 | Wilfred Sieg | Mechanical Procedures and Mathematical Experience |
| 25 | Wilfred Sieg | “Church's Thesis”, “Consistency”, “Formalization”, “Proof Theory”: Dictionary Entries |
| 24 | Wilfred Sieg | Mechanisierung Mathematischer Erfahrung Oder: Turings Problem [German] |
1991
| 23 | Peter Spirtes | Building Causal Graphs from Statistical Data in the Presence of Latent Variables |
| 21 | Wilfred Sieg | Searching for Proofs (in Sentential Logic) |
| 20 | Wilfred Sieg | Mechanical Procedures and Mathematical Experience |
| 19 | Richard Scheines, Peter Spries and Clark Glymour | Building Latent Variable Models |
| 18 | Kevin T. Kelly and Clark Glymour | Inductive Inference from Theory-Laden Data |
1990
| 16 | Peter Spirtes | Calculating TETRAD Constraints Implied by Directed Acyclic Graphs |
| 15 | Peter Spirtes and Clark Glymour | An Algorithm for Fast Recovery of Sparse Causal Graphs |
| 14 | Peter Spirtes and Clark Glymour | Casual Structure Among Measured Variables Preserved with Unmeasured Variables |
| 13 | Kevin T. Kelly | General Characteristics of Inductive Inference Over Arbitrary Sets of Data Representations |
1989
| 12 | Peter Spirtes, Clark Glymour and Richard Scheines | Causality From Probability |
| 11 | Bob Carpenter | ProP Documentation |
1988
| 10 | Clark Glymour and Kevin T. Kelly | Thoroughly Modern Meno |
| 9 | Clark Glymour and Kevin T. Kelly | Theory Discovery from Data with Mixed Quantifiers |
| 8 | Peter Spirtes, Richard Scheines and Clark Glymour | Simulated Studies of the Reliability of Computer-Aided Model Specification Using the TETRAD, EQS and LISREL Programs |
| 7 | Kevin T. Kelly | Theory Discovery and Hypothesis Language |
| 6 | Kevin T. Kelly | Version Spaces, Structural Descriptions and NP-Completeness |
1987
| 5 | Clark Glymour, Kevin T. Kelly and Peter Spirtes | The Expected Complexity of Problem Solving |
| 4 | Clark Glymour | Psychology as Physics |
| 3 | Kevin T. Kelly and Clark Glymour | Convergence to the Truth and Nothing But the Truth |
1986
| 2 | Kevin T. Kelly | The Automated Discovery of Universal Theories |
| 1 | Clark Glymour, Richard Scheines, Peter Spirtes and Kevin Kelly | Discovering Causal Structure: Artifical Intelligence, Philosophy of Science and Statistical Modeling |