40 found
Order:
Disambiguations
Stephen Pollard [40]Stephen Randall Pollard [1]
  1.  12
    Logic in the Land of Make-Believe.Stephen Pollard - forthcoming - Logic and Logical Philosophy:1.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  58
    Carlo Cellucci. Rethinking Knowledge: The Heuristic View.Stephen Pollard - 2017 - Philosophia Mathematica 25 (3):413-418.
    CarloCellucci. Rethinking Knowledge: The Heuristic View. Cham, Switzerland: Springer International Publishing, 2017. ISBN 978-3-319-53236-3, 978-3-319-53237-0. Pp. xx + 428††.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  53
    Mathematical Determinacy and the Transferability of Aboutness.Stephen Pollard - 2007 - Synthese 159 (1):83-98.
    Competent speakers of natural languages can borrow reference from one another. You can arrange for your utterances of ‘Kirksville’ to refer to the same thing as my utterances of ‘Kirksville’. We can then talk about the same thing when we discuss Kirksville. In cases like this, you borrow “ aboutness ” from me by borrowing reference. Now suppose I wish to initiate a line of reasoning applicable to any prime number. I might signal my intention by saying, “Let p be (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  56
    Milne's Measure of Confirmation.Stephen Pollard - 1999 - Analysis 59 (4):335–338.
  5.  23
    Reuben Hersh. Experiencing Mathematics: What Do We Do, When We Do Mathematics?. Providence, Rhode Island: American Mathematical Society, 2014. ISBN 978-0-8218-9420-0. Pp. Xvii + 291. [REVIEW]Stephen Pollard - 2014 - Philosophia Mathematica 22 (2):271-274.
  6.  55
    Plural Quantification and the Axiom of Choice.Stephen Pollard - 1988 - Philosophical Studies 54 (3):393 - 397.
  7.  41
    Mathematical Naturalism: An Anthropological Perspective.Stephen Pollard & Robert Bates Graber - 1989 - Southern Journal of Philosophy 27 (3):427-441.
  8.  22
    Ethical Guidance From Literature and Mathematics.Stephen Pollard - 2017 - Journal of Speculative Philosophy 31 (4):517-537.
    That mathematics makes for poor literature is a conclusion as uninteresting as it is inevitable—inevitable because were mathematical prose to score high on a scale of literary value, this result would do more to discredit the scale than glorify the prose. It may, however, help us better understand our cultural landscape if, without attempting a literary appraisal of mathematics or a mathematical appraisal of literature, we search for some community of interest between the formal sciences and the literary arts. This (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  33
    Plural Quantification and the Iterative Concept of Set.Stephen Pollard - 1985 - Philosophy Research Archives 11:579-587.
    Arecent paper by George Boolos suggests that it is philosophically respectable to use monadic second order logic in one’s explication of the iterative concept of set. I shall here give a partial indication of the new range of theories of the iterative hierarchy which are thus madeavailable to philosophers of set theory.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  44
    What is Abstraction?Stephen Pollard - 1987 - Noûs 21 (2):233-240.
  11.  13
    Milne's Measure of Confirmation.Stephen Pollard - 1999 - Analysis 59 (4):335-338.
  12.  49
    Who Needs Mereology?Stephen Pollard - 1997 - Philosophia Mathematica 5 (1):65-70.
    This note examines the mereological component of Geoffrey Hellman's most recent version of modal structuralism. There are plausible forms of agnosticism that benefit only a little from Hellman's mereological turn.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  40
    Mathematics for Property Theorists.Stephen Pollard & Norman M. Martin - 1986 - Philosophical Studies 49 (2):177 - 186.
  14.  33
    Sets, Wholes, and Limited Pluralitiest.Stephen Pollard - 1996 - Philosophia Mathematica 4 (1):42-58.
    This essay defends the following two claims: (1) liraitation-of-size reasoning yields enough sets to meet the needs of most mathematicians; (2) set formation and mereological fusion share enough logical features to justify placing both in the genus composition (even when the components of a set are taken to be its members rather than its subsets).
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  5
    The Expressive Unary Truth Functions of N -Valued Logic.Stephen Pollard - 2005 - Notre Dame Journal of Formal Logic 46 (1):93-105.
    The expressive truth functions of two-valued logic have all been identified. This paper begins the task of identifying the expressive truth functions of n-valued logic by characterizing the unary ones. These functions have distinctive algebraic, semantic, and closure-theoretic properties.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  4
    The Expressive Truth Conditions of Two-Valued Logic.Stephen Pollard - 2002 - Notre Dame Journal of Formal Logic 43 (4):221-230.
    In a finitary closure space, irreducible sets behave like two-valued models, with membership playing the role of satisfaction. If f is a function on such a space and the membership of in an irreducible set is determined by the presence or absence of the inputs in that set, then f is a kind of truth function. The existence of some of these truth functions is enough to guarantee that every irreducible set is maximally consistent. The closure space is then said (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  28
    Choice Again.Stephen Pollard - 1992 - Philosophical Studies 66 (3):285 - 296.
  18.  26
    A System of Logic Based on Conditional Proof.Stephen Pollard - 1987 - Teaching Philosophy 10 (2):129-134.
  19.  56
    'As If' Reasoning in Vaihinger and Pasch.Stephen Pollard - 2010 - Erkenntnis 73 (1):83 - 95.
    Hans Vaihinger tried to explain how mathematical theories can be useful without being true or even coherent, arguing that mathematicians employ a special kind of fictional or "as if" reasoning that reliably extracts truths from absurdities. Moritz Pasch insisted that Vaihinger was wrong about the incoherence of core mathematical theories, but right about the utility of fictional discourse in mathematics. This essay explores this area of agreement between Pasch and Vaihinger. Pasch's position raises questions about structuralist interpretations of mathematics.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  20.  5
    Expressive Three-Valued Truth Functions.Stephen Pollard - 2006 - Australasian Journal of Logic 4:226-245.
    The expressive truth functions of two-valued logic have all been characterized, as have the expressive unary truth functions of finitely-many-valued logic. This paper introduces some techniques for identifying expressive functions in three-valued logics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  9
    Homeomorphism and the Equivalence of Logical Systems.Stephen Pollard - 1998 - Notre Dame Journal of Formal Logic 39 (3):422-435.
    Say that a property is topological if and only if it is invariant under homeomorphism. Homeomorphism would be a successful criterion for the equivalence of logical systems only if every logically significant property of every logical system were topological. Alas, homeomorphisms are sometimes insensitive to distinctions that logicians value: properties such as functional completeness are not topological. So logics are not just devices for exploring closure topologies. One still wonders, though, how much of logic is topological. This essay examines some (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  44
    Book Review: Raymond M. Smullyan and Melvin Fitting. Set Theory and the Continuum Problem. [REVIEW]Stephen Pollard - 1997 - Notre Dame Journal of Formal Logic 38 (3):475-480.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  23.  17
    Transfinite Recursion in a Theory of Properties.Stephen Pollard - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (19-24):307-314.
  24.  28
    Some Mathematical Facts About Peirce's Game.Stephen Pollard - 2005 - Transactions of the Charles S. Peirce Society 41 (1):189 - 201.
  25.  28
    Mathematical Naturalism: An Anthropological Perspective.Stephen Pollard & Robert Bates Graber - 1989 - Southern Journal of Philosophy 27 (3):427-441.
  26.  21
    The Reality of Numbers: A Physicalist's Philosophy of Mathematics.Stephen Pollard - 1990 - Review of Metaphysics 43 (4):854-854.
    This book is about universals. "Mathematics," we learn, "is the theory of universals". Natural numbers turn out to be universals, as do real numbers, complex numbers, and sets. It is natural, therefore, that the reader demand some evidence that universals abound sufficiently to supply models of canonical mathematical theories. The author devotes nearly a third of his book to one potential source of such evidence: the Truthmaker axiom. In the case of some propositions P, Truthmaker entails that if P is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  24
    Review of Matthew E. Moore (Ed.), New Essays on Peirce's Mathematical Philosophy[REVIEW]Stephen Pollard - 2011 - Notre Dame Philosophical Reviews 2011 (2).
  28.  27
    Weyl on Sets and Abstraction.Stephen Pollard - 1988 - Philosophical Studies 53 (1):131 - 140.
  29.  6
    Philosophy of Mathematics and the New Conservation.Stephen Pollard - 1988 - Metaphilosophy 19 (1):1-10.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  6
    Plural Quantification and the Iterative Concept of Set.Stephen Pollard - 1985 - Philosophy Research Archives 11:579-587.
    Arecent paper by George Boolos suggests that it is philosophically respectable to use monadic second order logic in one’s explication of the iterative concept of set. I shall here give a partial indication of the new range of theories of the iterative hierarchy which are thus madeavailable to philosophers of set theory.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  24
    Philosophy of Mathematics and the New Conservation.Stephen Pollard - 1988 - Metaphilosophy 19 (1):1–10.
  32.  20
    A Peculiarity of the Empty Set.Stephen Pollard - 1985 - Southern Journal of Philosophy 23 (3):355-360.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  33.  8
    ‘As If’ Reasoning in Vaihinger and Pasch.Stephen Pollard - 2010 - Erkenntnis 73 (1):83-95.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  18
    Book Review: Penelope Maddy. Naturalism in Mathematics. [REVIEW]Stephen Pollard - 1999 - Notre Dame Journal of Formal Logic 40 (2):293-306.
  35.  9
    Transfinite Recursion in a Theory of Properties.Stephen Pollard - 1986 - Mathematical Logic Quarterly 32 (19‐24):307-314.
  36.  3
    A Stregthening of Scott's ZFØ Result.Stephen Pollard - 1990 - Notre Dame Journal of Formal Logic 31:369-370.
  37.  3
    A Peculiarity of The Empty Set.Stephen Pollard - 1985 - Southern Journal of Philosophy 23 (3):355-360.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  9
    David Gruber, 1958-2005.Stephen Pollard - 2006 - Proceedings and Addresses of the American Philosophical Association 79 (5):125 -.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39.  9
    A Strengthening of Scott's ${Rm ZF}^{Not=}$ Result.Stephen Pollard - 1990 - Notre Dame Journal of Formal Logic 31 (3):369-370.
  40.  5
    Contractions of Closure Systems.Stephen Pollard & Norman M. Martin - 1994 - Notre Dame Journal of Formal Logic 35 (1):108-115.
    This essay shows that some recent work by George Weaver can be reformulated in an especially perspicuous way within the theory of closure systems. Closure theoretic generalizations of some theorems of Robert Goldblatt are presented. And, more generally, the relation between closure systems and the deducibility relations of Goldblatt is explored.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark