Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

Advanced Search

Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

An Introduction to Separation Logic (Preliminary Draft)
Some Thoughts on Teaching Programming and Programming John C. Reynolds
PROFESSIONAL VITA John C. Reynolds
UndergradUate Carnegie Mellon
Methodology Carnegie Mellon
The Carnegie Mellon Alumni Association honors exceptional Carnegie Mellon alumni, students
Class Notes for CS 819A3 -Spring 2003 John C. Reynolds
Temporal type constructors for computer music programming
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
An Overview An Introduction
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
A New Category? Domains, Spaces and Equivalence Relations
Class Notes for CS 819A4 -Spring 2003 6. Trees and Dags
Equilogical Spaces Andrej Bauer, 1 Lars Birkedal, 2 Dana S. Scott 3
Topology and Computability Thesis Proposal
A General Notion of Realizability L. Birkedal \Lambda
Predicative Categories of Classes Michael Alton Warren
Under consideration for publication in Math. Struct. in Comp. Science Local Realizability Toposes and a Modal
A New Category for Semantics Andrej Bauer and Dana Scott
Class Notes for CS 819B -Spring 2004 1. Expressions, Commands, Assertions, and
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
MFPS 17 Preliminary Version A Relationship between Equilogical Spaces
A New Category? Domains, Spaces and Equivalence Relations
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Wtypes in sheaves Benno van den Berg & Ieke Moerdijk
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Class Notes for CS 819A4 -Spring 2003 3. Speci cations and Inference Rules
Continuous Functionals of Dependent Types and Equilogical Spaces
Propositions as [Types] Steve Awodey Andrej Bauer y
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
Class Notes for CS 819A3 -Spring 2003 1. Expressions, Commands, and Assertions
Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor)
Biometrika (2003), 90, 3, pp. 491515 2003 Biometrika Trust
Summer School in Logic and Formal Epistemology
Class Notes for CS 819A3 -Spring 2003 4. Procedures
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Two Constructive EmbeddingExtension Theorems with Applications to Continuity Principles
Class Notes for CS 819A4 -Spring 2003 5. Iterated Separating Conjunction
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Topology and Computability Thesis Proposal
Class Notes for CS 819B -Spring 2004 2. Programs that Use Arrays
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
CLF: A logical framework for concurrent systems Kevin Watkins
Class Notes for CS 819A4 -Spring 2003 9. Proving the Hypothetical Frame Rule
Bibliography [1] John C. Reynolds. Intuitionistic reasoning about shared mutable data
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Lists and List Segments An Introduction
Propositions as [Types] Steve Awodey Andrej Bauer y
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Project Description We propose to develop the theoretical and engineering basis for the trustless dissemination
An Introduction to Separation Logic
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Class Notes for CS 819B -Spring 2004 3. Procedures
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Reserved Books for CS 812 Programing Language Semantics Spring 2008
Propositions as [Types] Steve Awodey* Andrej Bauery
Ockham's Razor, Empirical Complexity, and Truth-finding Kevin T. Kelly
Tps3 Programmer's Guide Peter B. Andrews
When Fair Betting Odds Are Not Degrees of Belief T. Seidenfeld; M. J. Schervish; J. B. Kadane
Implementing a Framework for Certified Grid Margaret DeLap
Carnegie Mellon University 5000 Forbes Avenue
21-700 Mathematical Logic II Spring 2011 MWF 11:30 WEH 7201
Reserved Books for CS 812 Programing Language Semantics Spring 2010
Trees and Dags An Introduction
Class Notes for BRICS Minicourse -Fall 2003 SEPARATION LOGIC
Categorical Models of Intuitionistic Theories of Sets and Classes
Class Notes for CS 819A4 -Spring 2003 7. Special Classes of Assertions
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Sheaf Toposes for Realizability Steven Awodey
Iterated Separating Conjunction
Class Notes for CS 819A4 -Spring 2003 8. Information Hiding and the Hypothetical
Class Notes for CS 819A3 -Spring 2003 2. Speci cations and Their Inference Rules
Scalable Realtime Parallel Garbage Collection for Symmetric Multiprocessors
Specifications An Introduction
Class Notes for CS 819A4 -Spring 2003 John C. Reynolds
Class Notes for CS 818A4 -Spring 2004 SEPARATION LOGIC
Reserved Books for CS 812 Programing Language Semantics Spring 2006
Class Notes for CS 819A4 -Spring 2003 2. Expressions, Commands, and Assertions
Two Constructive EmbeddingExtension Theorems with Applications to Continuity Principles
Algebraic models of sets and classes in categories Steve Awodey and Henrik Forssell and Michael A. Warren
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Sheaves for predicative toposes Benno van den Berg
Class Notes for CS 818A3 -Spring 2005 AN INTRODUCTION TO
Sheaf Toposes for Realizability Steven Awodey
Class Notes for CS 819A4 -Spring 2003 1. An Introduction to Separation Logic
J. Symbolic Computation (1998) 11, 1--000 Multibasic and Mixed Hypergeometric
Category Descriptions Award Descriptions
SHORT EXTENDER FORCING MOTI GITIK AND SPENCER UNGER
Journal of Machine Learning Research 7 (2006) 191246 Submitted 3/05; Revised 9/05; Published 2/06 Learning the Structure of
The TETRAD Project: Constraint Based Aids to Causal Model Specification
Class Notes for CS 819 C -Spring 2002 3. Speci cations and Inference Rules
A Universal Automated Information System for Science and Technology
Bibliography on Linear Logic This bibliography is a byproduct of the seminar on Linear Logic and Applications held at
Understanding and Evolving the ML Module System
A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs
On the value of information Info-Metrics Workshop American Univ. Fall, 2009 1 On the value of information in games
Carnegie Mellon, Silicon Valley Campus San Bruno Fire Technical Debrief
Foundational Issues in Presupposition Mandy Simons
The Extent of Dilation of Sets of Probabilities and the Asymptotics of Robust Bayesian Inference
Bayesian Consensus? University of California Irvine (April 2, 2010) 1 Bayesian Consensus?
Carnegie Mellon University ASSUMPTION OF RISK & GENERAL RELEASE
Searching for proofs (and uncovering capacities of the mathematical mind)1
ITERATED FORCING AND THE CONTINUUM HYPOTHESIS Appalachian Set Theory Workshop, May 2930, 2009
CARNEGIE MELLON UNIVERSITY FACULTY LEAVE OF ABSENCE PROGRAM
A Study of Categories of Algebras and Coalgebras
KEVIN KELLY, OLIVER SCHULTE, VINCENT HENDRICKS RELIABLE BELIEF REVISION
Improper Regular Conditional Distributions Teddy Seidenfeld; Mark J. Schervish; Joseph B. Kadane
Causal Inference of Ambiguous Manipulations Peter Spirtes*
INTRODUCTION The story of Carnegie
Inferring Invariants in Separation Logic for Imperative List-processing Programs
Calibration, Coherence, and Scoring Rules Teddy Seidenfeld
Errata for Theories of Programming Languages The following are corrections of the errors and obscurities in ``Theories of Pro
Iktara in ConCert: Realizing a Certified Grid Computing Framework from a Programmer's
NIH, AHRQ and NIOSH ERROR CORRECTION WINDOW ELIMINATED NIH has decided to eliminate the error correction window from the electronic grant application
Class Notes for CS 819 C -Spring 2002 7. Semantics of Concurrency
CARNEGIE MELLON ETPS: A System to Help Students Write Formal Proofs
Classical Type Theory Peter B. Andrews
Set Comprehension in Church's Type Theory Dissertation Description
Directed Cyclic Graphical Representations of Feedback Peter Spirtes
21300 Basic Logic Lecturer Teaching Assistant
Sheaf Toposes for Realizability Steven Awodey
On Linear Inference Frank Pfennnig
Reply to Freedman by Peter Spirtes and Richard Scheines
Continuous and Algebraic (Notes for CS 819 ---April 17, 2000 ---c
CARNEGIE MELLON Herbrand Award Acceptance Speech
Constructing Bayesian Network Models of Gene Expression Networks from Microarray Data
Studia Logica (2007) 86: 353373 DOI: 10.1007/s11225-007-9065-6 Springer 2007
201011 University Advancement Student Programs Fall Semester
FOUNDER: REGINA GOUGER MILLER GALLERY AT CARNEGIE MELLON UNIVERSITY
Higher Categories from Type Theories Peter LeFanu Lumsdaine
BIOINFORMATICS Vol. 19 no. 9 2003, pages 11471152
Efficient Convergence Implies Ockham's Razor Kevin T. Kelly
Tps3 Programmer's Guide Peter B. Andrews
(in press). In S. Das, D. Caragea, W. H. Hsu, & S. M. Welch (Eds.), Computational methodologies in gene regulatory networks. Hershey, PA: IGI Global Publishing.
In S. Becker, S. Thrun, & K. Obermayer, eds. Advances in Neural Information Processing Systems 15. Cambridge, Mass.: The MIT Press. pp. 67-74.
Journal of Mathematical Psychology 47 (2003) 109121 Equilibria of the RescorlaWagner model
Also Inside: RICK RASHID: STILL BOLDLY GOING
Propositions as [Types] Steve Awodey
W-types in sheaves Benno van den Berg & Ieke Moerdijk
Algebraic models of sets and classes in categories Steve Awodey and Henrik Forssell and Michael A. Warren
Predicative Categories of Classes Michael Alton Warren
An Introduction to Separation Logic
Programming with Intersection Types and Bounded Polymorphism
Gdel on computability* Wilfried Sieg
SET MAPPING REFLECTION Appalachian Set Theory Workshop, May 31, 2008
What is Credit Scoring? Your credit score represents your history of how you have handled previous financial transactions and is
Journal of Mathematical Economics 45 (2009) 329340 Contents lists available at ScienceDirect
Topological representation of the calculus Carnegie Mellon University
Mating Search Without Path Enumeration
This is a preprint of a paper to appear in the Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, to
Using Path Diagrams as a Structural Equation Modelling by Peter Spirtes, Thomas Richardson, Chris Meek, Richard Scheines,
UPPSALA DISSERTATIONS IN MATHEMATICS Ultrasheaves
KEVIN KELLY , OLIVER SCHULTE , VINCENT HENDRICKS RELIABLE BELIEF REVISION
Using Etps on Andrew 1 Accessing Etps
Sheaf Representation for Topoi S. Awodey \Lambda
Class Notes for CS 819 C -Spring 2002 8. Future Directions
A variant of the double-negation translation Jeremy Avigad
Equal Opportunity Services Whitfield Hall, 143 N. Craig Street, Pittsburgh PA 15213 Everett Tademy, Director (412) 268-2012 et19@andrew.cmu.edu Larry Powell, EOS Manager (412) 268-2013 lpowell@andrew.cmu.edu
Graphical models, causal inference, and econometric models
GRADUATE STUDY IN ENVIRONMENT &
Logic in topoi: Functorial semantics for higherorder logic
arXiv:1008.3145v1[math.LO]18Aug2010 First-Order Logical Duality
Elementary Axioms for Local Maps of Toposes Steven Awodey \Lambda Lars Birkedal y
Types, Abstraction, and Parametric Polymorphism
TPS: A Theorem Proving System for Classical Type Theory
A Universal Automated Information System for Science and Technology
Logic in topoi: Functorial semantics for higherorder logic Dissertation abstract
21600 Mathematical Logic I Lecturer Teaching Assistant
Epistemological foundations for the representation of discourse context
This is a preprint of a paper that will appear in the Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer
CHURCH WITHOUT DOGMA: Axioms for computability
The Dimensionality of Mixed Ancestral Graphs by Peter Spirtes, Thomas Richardson and Chris Meek
Type Theory via Exact Categories Extended abstract
This is a preprint of a paper that will appear in the Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer
Learning Theory and Epistemology Kevin T. Kelly
READABLE PROOFS IN HOARE LOGIC
PCAL: Language Support for Proof-Carrying Authorization Systems
The Department of Modern Languages Major in French & Francophone Studies
Set Comprehension in Church's Type Theory
Epistemic Conditionals, Snakes, and Horacio L. Arl o Costa
Proof Search in an Authorization Logic Deepak Garg
B R I E F I N G B O O K T H E O F F I C E O F G O V E R N M E N T R E L A T I O N S
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
KEVIN T. KELLY AND OLIVER SCHULTE CHURCH'S THESIS AND HUME'S PROBLEM
Adjacency-Faithfulness and Conservative Causal Inference Joseph Ramsey Peter Spirtes
Proof Irrelevance and Strict De nitions in a Logical Framework
An example of local reasoning in BI pointer logic: the SchorrWaite graph marking algorithm
Horacio Arl o Costa First Order Extensions of Classical Systems of Modal
Distributed deductive databases, declaratively The L10 logic programming language
Graduate Student Financial Aid Guide
A Representation of Partially Ordered Preferences Teddy Seidenfeld; Mark J. Schervish; Joseph B. Kadane
Divisive Conditioning: Further Results on Dilation Timothy Herron; Teddy Seidenfeld; Larry Wasserman
Bylaws of the Carnegie Mellon University Alumni Association
Stateful Authorization Logic Proof Theory and a Case Study
DOI 10.1007/s11229-006-9066-4 ORIGINAL PAPER
SOCIAL NORMS, RATIONAL CHOICE AND BELIEF CHANGE HORACIO ARL O-COSTA AND ARTHUR PAUL PEDERSEN
Propositions as [Types] Steve Awodey
Automating the Meta Theory of Deductive Systems Carsten Schurmann
Bibliography [1] Rodney M. Burstall. Some techniques for proving correctness of pro-
Thesis Proposal: Practical Automated Theorem Proving with the
The Logical Basis of Evaluation Order and Pattern-Matching
Simplicity, Truth, and the Unending Game of Science Kevin T. Kelly
Countable Borel Equivalence Relations II Simon Thomas
Methodology Carnegie Mellon
Reasoning about Shared Mutable Data Structure
Belief revision conditionals: basic iterated Horacio Arl o-Costa 1
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
An Introduction to Causal Inference
Automated Discovery of Linear Feedback Models 1 Thomas Richardson and Peter Spirtes
Specifications An Introduction
SET THEORY AND OPERATOR ALGEBRAS ILIJAS FARAH AND ERIC WOFSEY
Countable Borel Equivalence Relations IV Simon Thomas
Countable Borel Equivalence Relations I Simon Thomas
A contrast between two decision rules for use with (convex) sets of probabilities: -Maximin versus E-admissibilty.
AN INTRODUCTION TO HYPERLINEAR AND SOFIC GROUPS VLADIMIR G. PESTOV AND ALEKSANDRA KWIATKOWSKA
Learning, Simplicity, Truth, and Misinformation Kevin T. Kelly
Carnegie Mellon Carnegie Mellon Financing Plan
Implementing a Framework for Certified Grid Margaret DeLap
An Introduction to Separation Logic (Preliminary Draft)
PRECISE, INTUITIONISTIC, AND SUPPORTED ASSERTIONS
Aronszajn Trees and the SCH Itay Neeman
The Department Of Modern Languages The Minor in French & Francophone Studies
Solving for Set Variables in Higher-Order Theorem Proving
Bibliography on Linear Logic This bibliography is a byproduct of the seminar on Linear Logic and Applications held at
Local Realizability Toposes and a Modal Logic for Computability (Extended Abstract)
When Several Bayesians Agree That There Will Be No Reasoning to a Foregone Joseph B. Kadane; Mark J. Schervish; Teddy Seidenfeld
Applying to math Ph.D. programs Slides to accompany lecture
5th International Symposium on Imprecise Probability: Theories and Applications, Prague, Czech Republic, 2007 Coherent Choice Functions under Uncertainty
PROFESSIONAL VITA John C. Reynolds
Naturalism Logicized Kevin T. Kelly
Reserved Books for CS 812 -Programing Language Semantics -Spring 2006
On The Mark Timing -Contractor License Hy-Tek's MEET MANAGER 0:01 AM 5/14/2011 Page 1 5th Annual Gator Invitational -5/13/2011
I choose these two cases because they have been very widely discussed in the literature. In1 particular, scalar implicatures are at the heart of a very vigorous current debate about the structure
CARNEGIE MELLON ETPS: A System to Help Students Write Formal Proofs
Type Systems for Programming Languages1 Robert Harper
On the Shared Preferences of Two Bayesian Decision Makers Teddy Seidenfeld; Joseph B. Kadane; Mark J. Schervish
March 2, 2009 ON THE EQUIVALENCE OF CONGLOMERABILITY AND
An Authorization Logic with Explicit Time1 Henry DeYoung Deepak Garg Frank Pfenning
Inferring Hidden Causes Tamar Kushnir (tkushnir@socrates.berkeley.edu), Alison Gopnik (gopnik@socrates.berkeley.edu), Laura
Purely Functional Data Structures Chris Okasaki
Emerging Greek Leaders Spring 2011 Thank you for your interest in the Emerging Greek Leaders program. Please take a few
2011 -2012 Dining Plan Agreement Last Name: First Name: Middle: 9 Digit ID Card # 81
R.A.Fisher on the Design of Experiments and Statistical Estimation (Presented at the Center for History and Philosophy of Science, Boston Univ., March 1990.)
Methodology Carnegie Mellon
For more information about Olympus, please visit our website: http://olympus.cs.cmu.edu/ A downloadable brochure is available at: http://olympus.cs.cmu.edu/about/BrochureReduced.pdf
The Annals of Statistics 2002, Vol. 30, No. 4, 9621030
First-Order Logical Duality Henrik Forssell
Grainless Semantics without Critical Regions
READABLE PROOFS IN HOARE LOGIC
Categories and CPO's (Notes for CS 819 ---February 15, 2000 ---c
21700 Mathematical Logic II Spring 2011 MWF 11:30 WEH 7201
Iterative Probability Kinematics Horacio Arl o-Costa and Richmond H. Thomason
The Limits of Causal Inference from Observational Peter Spirtes
Countable Borel Equivalence Relations III Simon Thomas
A Close Shave with Realism: How Ockham's Razor Helps Us Find the Truth1
Tutorial: Generic Elementary Embeddings Lecture 2: Consistency results
Semantics-based Program Analysis via Symbolic Composition of Transfer Relations
Ubiquity: 2002 Grace Hopper Celebration of Women in Computing lblum@cs.cmu.edu 1
A Conflict between Finite Additivity and Avoiding Dutch Book Teddy Seidenfeld; Mark J. Schervish
State-Dependent Utilities Mark J. Schervish; Teddy Seidenfeld; Joseph B. Kadane
Equal Opportunity Services Whitfield Hall, 143 N. Craig Street, Pittsburgh PA 15213 Everett Tademy, Director (412) 268-2012 et19@andrew.cmu.edu Larry Powell, EOS Manager (412)268-2013 lpowell@andrew.cmu.edu
A Cultural Perspective ... in Computing Blum, Frieze, Hazzan, Dias A Cultural Perspective on Gender Diversity in
Grants.gov Q&A Updated 01/25/11
A Proof-Carrying File System Deepak Garg and Frank Pfenning
Modal Types for Mobile Code Tom Murphy VII
A Logical Representation of Common Rules for Controlling Access to Classified Information
Proof Theory for Authorization Logic and its Application to a Practical File System
Project Description We propose to develop the theoretical and engineering basis for the trustless dissemination
Philosophical Psychology Vol. 18, No. 2, April 2005, pp. 259272
Equilogical Spaces Andrej Bauer, 1
TPS: A Theorem Proving System for Classical Type Theory
Notations used by TPS and ETPS [ A] means "A is not true".
21-300 Basic Logic Lecturer Teaching Assistant
21-600 Mathematical Logic I Lecturer Teaching Assistant
TPS User's Manual Peter B. Andrews
Using Etps on Andrew 1 Accessing Etps
GRADUATE STUDY IN INFORMATION, COMPUTER
GRADUATE STUDY IN HEALTH-RELATED FIELDS
Stafford Loans Interest Rate
Significant Changes to the Grant Proposal and Award Administration Guides
2009 2010 Student Life
Carnegie Mellon University ASSUMPTION OF RISK & GENERAL RELEASE
Contact: Astria Suparak, Director, as@cmu.edu Summer 2008 2011
Dialing Guide Last updated: July 31, 2007
Family Educational Rights & Privacy Act
2011 Benefits For Part-Time
2011 Benefits For Full-Time
2011 Benefits For Full-Time
Equal Opportunity Services Everett Tademy, Director (412) 268 2012 et19@andrew.cmu.edu Larry Powell, Coordinator (412) 268-2013 lpowell@andrew.cmu.edu
Carnegie Mellon University FSO PROPOSED PROJECT -one page
BXA Undergraduate Student Handbook Congratulations on being admitted to Carnegie Mellon University and welcome to the
2010 -2011 Dining Plan Agreement Last Name: First Name: Middle: 9 Digit ID Card # 81
A Proof-Carrying File System Deepak Garg
A Proof-Carrying File System Deepak Garg and Frank Pfenning
Seznami, vektorji in matrike Tokrat bomo spoznali osnovne metode za delo s seznami, tabelami, vektorji in matrikami. V Mathematici so seznami in tabele ista podatkovna
Risanje fraktalov z Mathematico Risemo fraktale, ki so samopodobni: celota je sestavljena iz kosov, ki so podobni celoti.
Conditional probability and defeasible inference Horacio Arlo Costa (hcosta@andrew.cmu.edu)
Bayesian Epistemology and Epistemic Conditionals: On the Status of the Export-Import Laws
BOUNDED RATIONALITY: MODELS FOR SOME FAST AND FRUGAL HORACIO ARL O COSTA AND ARTHUR PAUL PEDERSEN
Errata for CT2, Steve Awodey, 4/2011 p. 8, l. -8: remove extra vertical space following the displayed "It's the arrows ...".
The Bulletin of Symbolic Logic Volume 13, Number 3, Sept. 2007
LAWVERE-TIERNEY SHEAVES IN ALGEBRAIC SET S. AWODEY, N. GAMBINO, P. L. LUMSDAINE, AND M. A. WARREN
Generalized Topological Semantics for First-Order Modal Logic1
Homotopy Theoretic Aspects of Constructive Type Theory
Computing over the Reals: Where Turing Meets Newton lblum@cs.cmu.edu Computing over the Reals: Where Turing Meets Newton1
An Outreach Program for High School CS Teachers Lenore Blum
Celebrating 30 years of effective change! Lenore Blum Celebrating 30 years of effective change!
Women@SCS Action Plan 3/31/2003 cfrieze@cs.cmu.edu lblum@cs.cmu.edu1
Women in Computer Science: The Carnegie Mellon The environment for women in computer science at Carnegie Mellon University has been
LENORE BLUM (http://www.cs.cmu.edu/~lblum/)
Programming in Standard ML (DRAFT: VERSION 1.2 OF 11.02.11.)
Ockham's Razor, Truth, and Information Kevin T. Kelly
A Close Shave with Realism: How Ockham's Razor Helps Us Find the Truth1
Iterated Belief Revision, Reliability, and Inductive Kevin T. Kelly
The Learning Power of Belief Revision Kevin T. Kelly
Grainless Semantics without Critical Regions
Extensions of Expected Utility Theory and Some Limitations of Pairwise Comparisons
April 12, 2007 The Fundamental Theorems of Prevision
A Rate of Incoherence Applied to Fixed-Level Testing Mark J. Schervish; Teddy Seidenfeld; Joseph B. Kadane
Shared Preferences and State-Dependent Utilities Mark J. Schervish; Teddy Seidenfeld; Joseph B. Kadane
Reasoning to a Foregone Conclusion Joseph B. Kadane; Mark J. Schervish; Teddy Seidenfeld
Statistical Evidence and Belief Functions Teddy Seidenfeld
On After-Trial Properties of Best Neyman-Pearson Confidence Intervals Teddy Seidenfeld
Independence for Full Conditional Measures, Graphoids and Bayesian Networks
Dominating countably many forecasts.* T. Seidenfeld, M.J.Schervish, and J.B.Kadane.
7th International Symposium on Imprecise Probability: Theories and Applications, Innsbruck, Austria, 2011 Forecasting with Imprecise Probabilities
Extending Bayesian Theory to Cooperative Groups University of California Irvine (April 2, 2010) 1 Extending Bayesian Theory to Cooperative Groups
Getting to know your probabilities: Three ways to frame personal probabilities for decision making.
On mind & Turing's machines WILFRIED SIEG
ON COMPUTABILITY Wilfried Sieg
Note that the moment of interpretation is not the same as the moment of utterance. For1 details, see Stalnaker 1999, 2002, von Fintel 2000. It should be added that there are multiple
Presupposition without Common Ground Mandy Simons
Presupposing Mandy Simons
1.Here are two illustrative cases where this assumption is made, and where it indeed plays a fairly significant role in the theories developed. From Abbott 2000:"Typicallythe asserted
Semantics and Pragmatics in the Interpretation of or Mandy Simons
In Philosophical Studies 112: 251-278, 2003. ( Kluwer Academic Publishers) Presupposition and Accommodation: Understanding the
To appear in R. Hastings, B. Jackson and Z. Zvolensky, (eds.)ProceedingsofSemantics and Linguistic Theory 11, Ithaca, NY: CLC Publications
Mandy Simons Dept of Philosophy
Strong Faithfulness and Uniform Consistency in Causal Inference Jiji Zhang & Peter Spirtes
THE COMPLEXITY OF CLASSIFICATION PROBLEMS IN ERGODIC THEORY
Notes for the Tenth Appalachian Set Theory Workshop From the lectures given by Andreas Blass
Appalachian Set Theory Workshop on Coherent Sequences
An introduction to Pmax forcing Paul B. Larson
The Stability of Strategic Plasticity University of California, Irvine
arXiv:0906.4521v1[math.LO]24Jun2009 MARTIN-LOF COMPLEXES
Methodology Carnegie Mellon
Rational Analyses, Instrumentalism, and Implementations David Danks
Linear Continuations * Andrzej Filinski
Heuristic Greedy Search Algorithms for Latent Variable Models Peter Spirtes (Department of Philosophy, Carnegie Mellon Univeristy, ps7z@andrew.cmu.edu),
A Polynomial Time Algorithm For Determining DAG Equivalence in the Presence of Latent Variables and Selection Bias
An Anytime Algorithm for Causal Inference Peter Spirtes
THE UNIVERSITY OF CHICAGO LOGIC IN TOPOI
Causal Inference in the Presence of Latent Variables and Selection Peter Spirtes, Christopher Meek, and Thomas Richardson
It is further standardly assumed that that which projects is a presupposition. For an argument against1 identifying projection with (standard, classical) presuppositionality, see Roberts et. al. 2009. Chierchia and
System Description: TPS: A Theorem Proving System for Type Theory
REGISTRATION FORM UNITED KINGDOM AWARDS
Submitted to the X10 Workshop Distributed deductive databases, declaratively
Two Constructive Embedding-Extension Theorems with Applications to Continuity Principles
Argument, Inquiry, and the Unity of Science Kevin T. Kelly
Tutorial: Generic Elementary Embeddings Matt Foreman
Strategic Thinking: Educational Use & Cognitive Foundation*
Scheduling Deterministic Parallel Programs Daniel John Spoonhower
Iterated Separating Conjunction
IN THE UNITED STATES COURT OF APPEALS FOR THE SECOND CIRCUIT
Functional Programming with Names and Necessity Aleksandar Nanevski
Contraction On the decision-theoretical origins of minimal change and entrench-
Workshop on Realizability Preliminary Version Local Realizability Toposes and a Modal Logic
TPS User's Manual Peter B. Andrews
Technical Report CMUPhil72 Using Dseparation to Calculate Zero Partial Correlations in
A SHEAF THEORETIC APPROACH TO MEASURE Matthew Jackson
Dilation for Sets of Probabilities Teddy Seidenfeld; Larry Wasserman
Math. Proc. Camb. Phil. Soc. (2009), 146, 45 c 2008 Cambridge Philosophical Society doi:10.1017/S0305004108001783 Printed in the United Kingdom
Non-Interference in Constructive Authorization Logic Deepak Garg
COUNTABLE BOREL EQUIVALENCE RELATIONS SIMON THOMAS AND SCOTT SCHNEIDER
Value-based Contraction: A Representation Horacio Arl-Costa and Hailin Liu
Categorical Models of Intuitionistic Theories of Sets and Classes
Algebraic Set Theory Steve Awodey
Sheaves for predicative toposes Benno van den Berg
Relating first-order set theories, toposes and categories of classes
Aspects of Predicative Algebraic Set Theory II: Realizability
Aspects of Predicative Algebraic Set Theory III: Benno van den Berg & Ieke Moerdijk
CURRICULUM VITAE Edmund M. Clarke
In H. Beebee, C. Hitchcock, & P. Menzies (Eds.), Oxford handbook of causation. Oxford: Oxford University Press. 21. The Psychology of Causal Perception and Reasoning
A Theory of Causal Learning in Children: Causal Maps and Bayes Nets Alison Gopnik
Danks, D. (2006). (Not) learning a complex (but learnable) category. In R. Sun & N. Miyake (Eds.), Proceedings of the 28th annual meeting of the cognitive science society (pp. 1186-1191). Mahwah, N.J.: Lawrence Erlbaum Associates.
Explaining norms and norms explained David Danksa
CONCEPTUAL PROBLEMS IN STATISTICS, TESTING AND EXPERIMENTATION Chapter for Routledge Companion to the Philosophy of Psychology
Integrating locally learned causal structures with overlapping variables
Logical Modeling Frameworks for the Optimization of Discrete-Continuous Systems
Controlling E ects Andrzej Filinski
Translucent Sums: A Foundation for Higher-Order Module Systems
Semantics-based parallel cost models and their use in provably e cient implementations
A Game Theoretic Argument For Ockham's Conor Mayo-Wilson
HOW TO DO THINGS WITH AN INFINITE Kevin T. Kelly
A Tale of Two Planners: Modular Robotic Planning with LDP Michael De Rosa
Reserved Books for CS 812 -Programing Language Semantics -Spring 2010
Trees and Dags An Introduction
Reserved Books for CS 812 -Programing Language Semantics -Spring 2008
Tutorial: Generic Elementary Embeddings Lecture 3: Towers
David Danks Department of Philosophy, Carnegie Mellon University; and
Class Notes for CS 819 C -Spring 2002 1. An Introduction to Separation Logic
Methodology Carnegie Mellon
AssociAte History Professor cAroline Acker received tHe 2008 BenjAmin rusH individuAl PuBlic HeAltH AwArd.
Mistakes to Avoid When Applying for Student Aid As of January 25, 2011
TYPE THEORY AND HOMOTOPY STEVE AWODEY
Two Constructive Embedding-Extension Theorems with Applications to Continuity Principles
Towards a Grainless Semantics for Shared Variable Concurrency
Methodology Carnegie Mellon
pp: 1--23 (col.fig.: nil) PROD. TYPE: COM
Direct Inference and Inverse Inference Teddy Seidenfeld
Equal Opportunity Services Whitfield Hall, 143 N. Craig Street, Pittsburgh PA 15213 Everett Tademy, Director (412) 268-2012 et19@andrew.cmu.edu Larry Powell, EOS Manager (412)268-2013 lpowell@andrew.cmu.edu
A language for mathematical knowledge management
Introductory Computer Science Education at Carnegie Mellon University
UNCORRECTEDPROOF 1 Justification as Truth-Finding Efficiency: How
A Dependently Typed Programming Language, with applications to Foundational Certified Code Systems
Lists and List Segments An Introduction
Sheaf Toposes for Realizability Steven Awodey
Countable Borel Equivalence Relations: The Appendix
R. A. Fisher's Fiducial Argument and Bayes' Theorem Teddy Seidenfeld
1. Zoltan Szb points out (p.c.) that Grice may be reluctant to call this background proposition an implicature because the speaker does not really intend to convey this
Contextual Modals Horacio Arlo Costa1
Separation Logic: A Logic for Shared Mutable Data Structures John C. Reynolds
2011 Benefits For Full-Time
An Authorization Logic with Explicit Time Henry DeYoung Deepak Garg Frank Pfenning
A Proof-Carrying File System with Revocable and Use-Once Certificates
Dependent Session Types via Intuitionistic Linear Type Theory
Weak Focusing for Ordered Linear Logic Robert J. Simmons Frank Pfenning
The Focused Constraint Inverse Method for Intuitionistic Modal Logics
in ConCert: Realizing a Certified Grid Computing Framework from a Programmer's
Horacio Arlo-Costa Eric Pacuit
Bibliography on Linear Logic This bibliography is a by-product of the seminar on Linear Logic and Applica*
Bibliography on Linear Logic This bibliography is a by-product of the seminar on Linear Logic and Applica*
An Overview An Introduction
Brit. J. Phil. Sci. 56 (2005), 791807 Scientific Coherence and the
Curriculum Vitae Horacio Arlo Costa
NSF grant DMS-0139911 Value of information [62C05]62C05
Three contrasts between two senses of coherence Teddy Seidenfeld
C0 Library Documentation Rob Arnold William Lovas
June 17, 2011 The Effect of Exchange Rates on Statistical Decisions
3RD FLOOR GALLERY All measurements in
Notes for Session 1, Dominance and Book, Summer School 2011 T.Seidenfeld 1 Session 1: Dominance and de Finetti's "Book" argument
An Introduction to Rational Choice Theory CMU Summer School in Logic and Formal Epistemology
SPECIAL EVENT RENTAL POLICY Revised July 2009
Proof-Carrying Code in a Session-Typed Process Calculus
Annotated Bibliography for Rational Choice Week #1 of CMU's Formal Philosophy Summer School 2011
Making Program Logics Intelligible John C. Reynolds
Notes for Session 7, Basic Voting Theory, Summer School 2011 T.Seidenfeld 1 Notes for Session 7 Basic Voting Theory
Making Program Logics Intelligible John C. Reynolds
ISIPTA '11 Proceedings of the
Notes for Session 4, Classical Game Theory, Summer School 2011 T.Seidenfeld 1 Session 4: Classical Game Theory von Neumann and Nash
Stateful Authorization Logic Proof Theory and a Case Study
C0 Reference 15-122: Principles of Imperative Computation
On the strengths and weaknesses of weak squares Menachem Magidor and Chris Lambie-Hanson
PROPER FORCING REMASTERED BOBAN VELICKOVIC AND GIORGIO VENTURI
... Hotbits and Random.org exist mostly as educational diversions. They don't pour out random numbers fast enough for such voracious demands as ultra high-security cryptography. Several
Summer School in Logic and Formal Epistemology