Results for 'Jonathan Seldin'

(not author) ( search as author name )
1000+ found
Order:
  1. On the proof theory of the intermediate logic MH.Jonathan P. Seldin - 1986 - Journal of Symbolic Logic 51 (3):626-647.
    A natural deduction formulation is given for the intermediate logic called MH by Gabbay in [4]. Proof-theoretic methods are used to show that every deduction can be normalized, that MH is the weakest intermediate logic for which the Glivenko theorem holds, and that the Craig-Lyndon interpolation theorem holds for it.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  2.  50
    A sequent calculus for type assignment.Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):11-28.
  3.  50
    Normalization and excluded middle. I.Jonathan P. Seldin - 1989 - Studia Logica 48 (2):193 - 217.
    The usual rule used to obtain natural deduction formulations of classical logic from intuitionistic logic, namely.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  4.  29
    The ${\bf Q}$-consistency of ${\cal F}_{22}$.Jonathan P. Seldin - 1977 - Notre Dame Journal of Formal Logic 18 (1):117-127.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  15
    John T. Kearns. Combinatory logic with discriminators. The journal of symbolic logic, vol. 34 , pp. 561–575.Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (2):339-340.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  44
    Curry’s Formalism as Structuralism.Jonathan P. Seldin - 2011 - Logica Universalis 5 (1):91-100.
    In 1939, Curry proposed a philosophy of mathematics he called formalism. He made this proposal in two works originally written then, although one of them was not published until 1951. These are the two philosophical works for which Curry is known, and they have left a false impression of his views. In this article, I propose to clarify Curry’s views by referring to some of his later writings on the subject. I claim that Curry’s philosophy was not what is now (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  34
    Arithmetic as a study of formal systems.Jonathan P. Seldin - 1975 - Notre Dame Journal of Formal Logic 16 (4):449-464.
  8.  22
    Interpreting HOL in the calculus of constructions.Jonathan P. Seldin - 2004 - Journal of Applied Logic 2 (2):173-189.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  37
    A second corrigendum to my paper: "Note on definitional reductions".Jonathan P. Seldin - 1980 - Notre Dame Journal of Formal Logic 21 (4):728-728.
  10.  25
    Corrigendum to my paper: "Note on definitional reductions".Jonathan P. Seldin - 1969 - Notre Dame Journal of Formal Logic 10 (4):412-412.
  11.  29
    Note on definitional reductions.Jonathan P. Seldin - 1968 - Notre Dame Journal of Formal Logic 9 (1):4-6.
  12.  26
    A sequent calculus formulation of type assignment with equality rules for the \ambdaβ-calculus.Jonathan P. Seldin - 1978 - Journal of Symbolic Logic 43 (4):643-649.
  13.  39
    On the proof theory of Coquand's calculus of constructions.Jonathan P. Seldin - 1997 - Annals of Pure and Applied Logic 83 (1):23-101.
  14.  88
    On the role of implication in formal logic.Jonathan P. Seldin - 2000 - Journal of Symbolic Logic 65 (3):1076-1114.
    Evidence is given that implication (and its special case, negation) carry the logical strength of a system of formal logic. This is done by proving normalization and cut elimination for a system based on combinatory logic or λ-calculus with logical constants for and, or, all, and exists, but with none for either implication or negation. The proof is strictly finitary, showing that this system is very weak. The results can be extended to a "classical" version of the system. They can (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  15.  25
    Equality in.Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (4):571-575.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  42
    Equality in f21.Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (4):571 - 575.
  17.  23
    Equality in $mathscr{F}_{21}$.Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (4):571-575.
  18.  26
    Set Theory based on Combinatory Logic.Jonathan P. Seldin & Maarten Wicher Visser Bunder - 1970 - Journal of Symbolic Logic 35 (1):147.
  19.  28
    The logic of Church and Curry.Jonathan P. Seldin - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--819.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  39
    Some anomalies in Fitch's system QD.M. W. Bunder & Jonathan P. Seldin - 1978 - Journal of Symbolic Logic 43 (2):247-249.
  21.  26
    Edward J. Cogan. A formalization of the theory of sets from the point of view of combinatory logic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 , pp. 198–240. - Rainer Titgemeyer. Über einen Widerspruch in Cogans Darstellung der Mengenlehre.Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 161–163. [REVIEW]Jonathan P. Seldin - 1970 - Journal of Symbolic Logic 35 (1):147.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  19
    Review: John T. Kearns, Combinatory Logic with Discriminators. [REVIEW]Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (2):339-340.
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  14
    Corrado Böhm and Wolf Gross. Introduction to the CUCH. Automata theory, edited by E. R. Caianiello, Academic Press, New York and London1966, pp. 35–65. Reprinted in Pubblicazioni dell'Istituto Nazionale per le Applicazioni del Calcolo, ser. 11 no. 669, Rome 1966. - C. Böhm. The CUCH as a formal and description language. Formal language description languages for computer programming, Proceedings of the IFIP Working Conference on Formal Language Description Languages, edited by T. B. SteelJr., North-Holland Publishing Company, Amsterdam1966, pp. 179–197. [REVIEW]Jonathan P. Seldin - 1975 - Journal of Symbolic Logic 40 (1):81-83.
  24.  28
    Variants of the basic calculus of constructions.M. W. Bunder & Jonathan P. Seldin - 2004 - Journal of Applied Logic 2 (2):191-217.
  25.  23
    Bridging Curry and Church's typing style.Fairouz Kamareddine, Jonathan P. Seldin & J. B. Wells - 2016 - Journal of Applied Logic 18:42-70.
  26.  18
    Review: N. G. De Bruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. [REVIEW]Jonathan P. Seldin - 1975 - Journal of Symbolic Logic 40 (3):470-470.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  27.  28
    Jean-Pierre Ginisti. La logique combinatoire. Qui sais-je? no. 3205. Presses Universitaires de France, Paris1997, 127 pp. [REVIEW]Jonathan P. Seldin - 1999 - Journal of Symbolic Logic 64 (4):1833-1834.
  28.  14
    Maarten Wicher Visser Bunder. Set theory based on combinatory logic. Dissertation Amsterdam 1969, 80 pp. + 3 pp. of corrections. [REVIEW]Jonathan P. Seldin - 1970 - Journal of Symbolic Logic 35 (1):147-148.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  31
    Review: Jean-Pierre Ginisti, La Logique Combinatoire. [REVIEW]Jonathan P. Seldin - 1999 - Journal of Symbolic Logic 64 (4):1833-1834.
  30.  31
    Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
    Direct download  
     
    Export citation  
     
    Bookmark   59 citations  
  31.  83
    On adding (ξ) to weak equality in combinatory logic.Martin W. Bunder, J. Roger Hindley & Jonathan P. Seldin - 1989 - Journal of Symbolic Logic 54 (2):590-607.
    Because the main difference between combinatory weak equality and λβ-equality is that the rule \begin{equation*}\tag{\xi} X = Y \vdash \lambda x.X = \lambda x.Y\end{equation*} is valid for the latter but not the former, it is easy to assume that another way of defining combinatory β-equality is to add rule (ξ) to the postulates for weak equality. However, to make this true, one must choose the definition of combinatory abstraction in (ξ) very carefully. If one tries to use one of the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  32. To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism.Haskell Curry, Hindley B., Seldin J. Roger & P. Jonathan (eds.) - 1980 - Academic Press.
    No categories
     
    Export citation  
     
    Bookmark  
  33.  23
    Review: J. Roger Hindley, Jonathan P. Seldin, Introduction to Combinators and $lambda$-Calculus. [REVIEW]J. L. Krivine - 1988 - Journal of Symbolic Logic 53 (3):985-986.
  34.  14
    J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp. [REVIEW]J. L. Krivine - 1988 - Journal of Symbolic Logic 53 (3):985-986.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  17
    Review: Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin, Combinatory Logic. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
  36.  24
    Combinatory logic. Haskell B. Curry, J. Roger Hindley, and Jonathan P. Seldin. Combinatory logic. Volume II. Studies in logic and the foundations of mathematics, vol. 65. North-Holland Publishing Company, Amsterdam and London 1972, XIV + 520 pp. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
  37. Taking a Naturalistic Turn in the Health and Disease Debate.Jonathan Sholl & Simon Okholm - 2021 - Teorema: International Journal of Philosophy (1):91-109.
    We situate the well-trodden debate about defining health and disease within the project of a metaphysics of science and its aim to work with and contribute to science. We make use of Guay and Pradeu’s ‘metaphysical box’ to reframe this debate, showing what is at stake in recent attempts to move beyond it, revealing unforeseen points of agreement and disagreement among new and old positions, and producing new questions that may lead to progress. We then discuss the implications of the (...)
     
    Export citation  
     
    Bookmark   3 citations  
  38.  25
    Escaping the Conceptual Analysis Straightjacket: Pathological Mechanisms and Canguilhem’s Biological Philosophy.Jonathan Sholl - 2015 - Perspectives in Biology and Medicine 58 (4):395-418.
    This essay discusses four key criticisms recently leveled against the main attempts to use conceptual analysis to understand health and disease. First, it examines the weaknesses of these attempts and suggests a better way to proceed. Next, it briefly discusses another disease debate concerning pathological mechanisms and suggests that this approach could be more fruitful than that of conceptual analysis. The final section demonstrates how Georges Canguilhem's biological philosophy of disease avoids some of the problems associated with conceptual analysis, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  39.  4
    How is ‘Health’ Explained Across the Sciences? Conclusions and Recapitulation.Jonathan Sholl & Suresh Rattan - 2020 - In Jonathan Sholl & Suresh I. S. Rattan (eds.), Explaining Health Across the Sciences. Springer Nature. pp. 541-549.
    In this concluding chapter, we gather the various contributions of this volume and attempt to extract some of the many key insights and challenges raised when it comes to the project of explaining health across the sciences. These insights were distilled down into a selection of the central concepts and issues defended or discussed by the authors, and were organized into a table to see, at a glance, where the attention was given. Reflecting on these insights will go some way (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  40. Form and cognition: How to go out of your mind.Jonathan Jacobs and John Zeis - 1997 - The Monist 80 (4):539-557.
    It would be very desirable to have an account of the relation between mind and world that sustained the integrity of each. In this paper, we will argue that a theory of cognition which is broadly Thomistic can do just that. Many commentators recognize that cognitio is Aquinas’s basic epistemic concept, and that it designates knowledge in the broadest and most basic sense, as distinguished from scientia, or knowledge in the paradigmatic sense. There are several important consequences of this distinction (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  41.  9
    The Concepts of Ethics.Jonathan Harrison - 1963 - Philosophical Quarterly 13 (52):281-282.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  27
    The Sense of the Past: Essays in the History of Philosophy. By Bernard Williams, edited by Myles Burnyeat.Jonathan Wright - 2009 - Heythrop Journal 50 (2):312-313.
  43.  5
    The Sciences of Healthy Aging Await a Theory of Health.Jonathan Sholl - 2020 - Biogerontology 21 (3):399-409.
    Debates in fields studying the biological aspects of aging and longevity, such as biogerontology, are often split between ‘anti-aging’ approaches aimed largely at treating diseases and those focusing more on maintaining, promoting, and even enhancing health. However, it is far from clear what this ‘health’ is that would be maintained, promoted, or enhanced. Interestingly, what few have yet to fully reflect on is that there is still no theory of health within the health or aging sciences that would provide an (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Deterministic Chance?Jonathan Schaffer - 2007 - British Journal for the Philosophy of Science 58 (2):113-140.
    Can there be deterministic chance? That is, can there be objective chance values other than 0 or 1, in a deterministic world? I will argue that the answer is no. In a deterministic world, the only function that can play the role of chance is one that outputs just Os and 1s. The role of chance involves connections from chance to credence, possibility, time, intrinsicness, lawhood, and causation. These connections do not allow for deterministic chance.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   113 citations  
  45.  15
    Colour: some philosophical problems from Wittgenstein.Jonathan Westphal - 1987 - New York, NY, USA: Blackwell.
  46.  20
    Turing patterns in deserts.Jonathan A. Sherratt - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 667--674.
    Direct download  
     
    Export citation  
     
    Bookmark  
  47. The Self and Pure Consciousness.Jonathan Shear - 1972 - Dissertation, University of California, Berkeley
  48.  15
    Acknowledgments.Jonathan Short, Michael Palamarek, Kathy Kiloh, Colin J. Campbell & Donald Burke - 2007 - In Donald Burke, Colin J. Campbell, Kathy Kiloh, Michael Palamarek & Jonathan Short (eds.), Adorno and the Need in Thinking: New Critical Essays. University of Toronto Press.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  17
    Contents.Jonathan Short, Michael Palamarek, Kathy Kiloh, Colin J. Campbell & Donald Burke - 2007 - In Donald Burke, Colin J. Campbell, Kathy Kiloh, Michael Palamarek & Jonathan Short (eds.), Adorno and the Need in Thinking: New Critical Essays. University of Toronto Press.
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  14
    Frontmatter.Jonathan Short, Michael Palamarek, Kathy Kiloh, Colin J. Campbell & Donald Burke - 2007 - In Donald Burke, Colin J. Campbell, Kathy Kiloh, Michael Palamarek & Jonathan Short (eds.), Adorno and the Need in Thinking: New Critical Essays. University of Toronto Press.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000