Results for 'International Workshop on Higher Order Logic Theorum Proving and its Applications'

975 found
Order:
  1. Plausibility Revision in Higher-Order Logic With an Application in Two-Dimensional Semantics.Erich Rast - 2010 - In Arrazola Xabier & Maria Ponte, LogKCA-10 - Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge. ILCLI.
    In this article, a qualitative notion of subjective plausibility and its revision based on a preorder relation are implemented in higher-order logic. This notion of plausibility is used for modeling pragmatic aspects of communication on top of traditional two-dimensional semantic representations.
     
    Export citation  
     
    Bookmark   2 citations  
  2.  28
    Introduction to HOL: A Theorem Proving Environment for Higher Order Logic.Michael J. C. Gordon & Tom F. Melham - 1993
    Higher-Order Logic (HOL) is a proof development system intended for applications to both hardware and software. It is principally used in two ways: for directly proving theorems, and as theorem-proving support for application-specific verification systems. HOL is currently being applied to a wide variety of problems, including the specification and verification of critical systems. Introduction to HOL provides a coherent and self-contained description of HOL containing both a tutorial introduction and most of the material (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  3. Higher-order automated theorem proving.Michael Kohlhase - unknown
    The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first- (...) terms, since it has to take the theory of αβη-equality into account. As a consequence, the higher-order unification problem is undecidable and sets of solutions need not even always have most general elements that represent them. Thus the mentioned calculi for higher-order logic have take special measures to circumvent the problems posed by the theoretical complexity of higher-order unification. In this paper, we will exemplify the methods and proof- and model-theoretic tools needed for extending first-order automated theorem proving to higherorder logic. For the sake of simplicity take the tableau method as a basis (for a general introduction to first-order tableaux see part I.1) and discuss the higherorder tableau calculi HT and HTE first presented in [19]. The methods in this paper also apply to higher-order resolution calculi [1, 13, 6] or the higher-order matings method of Peter [3], which extend their first-order counterparts in much the same way. Since higher-order calculi cannot be complete for the standard semantics by Gödel’s incompleteness theorem [11], only the weaker notion of Henkin models [12] leads to a meaningful notion of completeness in higher-order logic. It turns out that the calculi in [1, 13, 3, 19] are not Henkin-complete, since they fail to capture the extensionality principles of higher-order logic. We will characterize the deductive power of our calculus HT (which is roughly equivalent to these calculi) by the semantics of functional Σ-models. To arrive at a calculus that is complete with respect to Henkin models, we build on ideas from [6] and augment HT with tableau construction rules that use the extensionality principles in a goal-oriented way.. (shrink)
     
    Export citation  
     
    Bookmark   5 citations  
  4.  10
    Computer Science Logic: 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers.M. Nielsen, Wolfgang Thomas & European Association for Computer Science Logic - 1998 - Springer Verlag.
    This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its (...) and thus presents the state of the art in the area. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5. Higher-order logic as metaphysics.Jeremy Goodman - 2024 - In Peter Fritz & Nicholas K. Jones, Higher-Order Metaphysics. Oxford University Press.
    This chapter offers an opinionated introduction to higher-order formal languages with an eye towards their applications in metaphysics. A simply relationally typed higher-order language is introduced in four stages: starting with first-order logic, adding first-order predicate abstraction, generalizing to higher-order predicate abstraction, and finally adding higher-order quantification. It is argued that both β-conversion and Universal Instantiation are valid on the intended interpretation of this language. Given these two principles, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  6.  9
    Extensions of Logic Programming: International Workshop, Tübingen, FRG, December 8-10, 1989. Proceedings.Peter Schroeder-Heister - 1991 - Springer.
    This volume contains finalized versions of papers presented at an international workshop on extensions of logic programming, held at the Seminar for Natural Language Systems at the University of Tübingen in December 1989. Several recent extensions of definite Horn clause programming, especially those with a proof-theoretic background, have much in common. One common thread is a new emphasis on hypothetical reasoning, which is typically inspired by Gentzen-style sequent or natural deduction systems. This is not only of theoretical (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  21
    Axiomatizing higher-order Kleene realizability.Jaap van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):87-111.
    Kleene's realizability interpretation for first-order arithmetic was shown by Hyland to fit into the internal logic of an elementary topos, the “Effective topos” . In this paper it is shown, that there is an internal realizability definition in , i.e. a syntactical translation of the internal language of into itself of form “n realizes ” , which extends Kleene's definition, and such that for sentences , the equivalence [harr]n is true in . The internal realizability definition depends on (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8.  37
    A Philosophical Introduction to Higher-order Logics.Andrew Bacon - 2023 - Routledge.
    This is the first comprehensive textbook on higher order logic that is written specifically to introduce the subject matter to graduate students in philosophy. The book covers both the formal aspects of higher-order languages -- their model theory and proof theory, the theory of λ-abstraction and its generalizations -- and their philosophical applications, especially to the topics of modality and propositional granularity. The book has a strong focus on non-extensional higher-order logics, making (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  6
    Extensions of Logic Programming: Second International Workshop, ELP '91, Stockholm, Sweden, January 27-29, 1991. Proceedings.Lars-Henrik Eriksson & Lars Hallnäs - 1992 - Springer Verlag.
    This volume contains papers presented at the second international workshop on extensions of logic programming, which was held at the Swedish Institute of Computer Science, Stockhom, January 27-29, 1991. The 12 papers describe and discuss several approaches to extensions of logic programming languages such as PROLOG, as well as connections between logic programming and functional programming, theoretical foundations of extensions, applications, and programming methodologies. The first workshop in this series was held in T}bingen (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  9
    Extensions of Logic Programming: 5th International Workshop, Elp '96, Leipzig, Germany, March 28 - 30, 1996. Proceedings.Roy Dyckhoff, Heinrich Herre & Peter Schroeder-Heister - 1996 - Springer Verlag.
    A major strategy to reduce transport congestion and other social costs of transport is to ensure that travellers make the best decisions, based on real time information. A wide range of technological systems have been developed to provide this information, but little is known about how travellers actually respond to it. This book offers an overview of various transport telematics options and provides an appropriate methodological framework, followed by a presentation of results from actual applications of these telematics systems (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11. (1 other version)Higher-Order Evidence.Kevin Dorst - 2023 - In Maria Lasonen-Aarnio & Clayton Littlejohn, The Routledge Handbook of the Philosophy of Evidence. New York, NY: Routledge. pp. 176-194.
    On at least one of its uses, ‘higher-order evidence’ refers to evidence about what opinions are rationalized by your evidence. This chapter surveys the foundational epistemological questions raised by such evidence, the methods that have proven useful for answering them, and the potential consequences and applications of such answers.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  12. Not much higher-order vagueness in Williamson’s ’logic of clarity’.Nasim Mahoozi & Thomas Mormann - manuscript
    This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come along with (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  8
    International humanitarian laws: Applicable to all or a privilege for some?S. Mahomed - forthcoming - South African Journal of Bioethics and Law:e2058.
    There is an intrinsic connection between genocide and colonialism where both concepts are in close proximity and are based on the logic of elimination. The fact that an active genocide of the Palestinian people continues in 2024 is extremely disturbing. A plethora of human rights laws and principles complement and reinforce the protections afforded under international humanitarian law. These laws were developed in order to prevent historical atrocities from repeating themselves. As history is re-written, it is submitted (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14.  16
    Why, Through Application of Its Educational Principles, the New World Order Can Never Generate Higher Education.Peter A. Redpath - 2020 - Studia Gilsoniana 9 (4):651-661.
    This article defends the teaching of Mortimer J. Adler that human education must aim at the betterment of human beings by forming good habits in us; and that, if intellectual and moral virtues, or good habits, are the same for all human beings because our natural capacities are the same and tend naturally to the same developments, then what logically follows is that the intellectual and moral virtues, or good habits, as the ends of education, are the absolute and universal (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  10
    Computational Logic — CL 2000: First International Conference London, UK, July 24–28, 2000 Proceedings.John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv & Peter J. Stuckey - 2000 - Springer Verlag.
    These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International Conference on (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  16.  23
    Nonclassical Logics and Their Applications: Post-Proceedings of the 8th International Workshop on Logic and Cognition.Shier Ju, Alessandra Palmigiano & Minghui Ma (eds.) - 2020 - Singapore: Springer.
    This edited book focuses on non-classical logics and their applications, highlighting the rapid advances and the new perspectives that are emerging in this area. Non-classical logics are logical formalisms that violate or go beyond classical logic laws, and their specific features make them particularly suited to describing and reason about aspects of social interaction. The richness and diversity of non-classical logics mean that this area is a natural catalyst for ideas and insights from many different fields, from information (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Non-classical Metatheory for Non-classical Logics.Andrew Bacon - 2013 - Journal of Philosophical Logic 42 (2):335-355.
    A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  18.  6
    COLOG-88: International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings.Per Martin-Löf & Grigori Mints - 1990 - Springer Verlag.
    This volume contains several invited papers as well as a selection of the other contributions. The conference was the first meeting of the Soviet logicians interested in com- puter science with their Western counterparts. The papers report new results and techniques in applications of deductive systems, deductive program synthesis and analysis, computer experiments in logic related fields, theorem proving and logic programming. It provides access to intensive work on computer logic both in the USSR and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  49
    Cumulative Higher-Order Logic as a Foundation for Set Theory.Wolfgang Degen & Jan Johannsen - 2000 - Mathematical Logic Quarterly 46 (2):147-170.
    The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness theorem for K∞α is proved by the method of reduction trees, and it is shown that every model of K∞α is equivalent to a cumulative hierarchy of sets. This is used to show that several axiomatic first-order set theories can be interpreted in K∞α, for suitable α.
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  20. Generalized Logic: A Philosophical Perspective with Linguistic Applications.Gila Sher - 1989 - Dissertation, Columbia University
    The question motivating my investigation is: Are the basic philosophical principles underlying the "core" system of contemporary logic exhausted by the standard version? In particular, is the accepted narrow construal of the notion "logical term" justified? ;As a point of comparison I refer to systems of 1st-order logic with generalized quantifiers developed by mathematicians and linguists . Based on an analysis of the Tarskian conception of the role of logic I show that the standard division of (...)
     
    Export citation  
     
    Bookmark   2 citations  
  21. Higher-Order Metaphysics: An Introduction.Peter Fritz & Nicholas K. Jones - 2024 - In Peter Fritz & Nicholas K. Jones, Higher-Order Metaphysics. Oxford University Press.
    This chapter provides an introduction to higher-order metaphysics as well as to the contributions to this volume. We discuss five topics, corresponding to the five parts of this volume, and summarize the contributions to each part. First, we motivate the usefulness of higher-order quantification in metaphysics using a number of examples, and discuss the question of how such quantifiers should be interpreted. We provide a brief introduction to the most common forms of higher-order logics (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  22.  8
    Computer Science Logic 16th International Workshop, Csl 2002, 11th Annual Conference of the Eacsl, Edinburgh, Scotland, Uk, September 2002 : Proceedings.Julian Bradfield - 2002 - Springer Verlag.
    The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  15
    A Stit Logic of Intentionality.Aldo Iván Ramírez Abarca & Jan Broersen - 2023 - In Carlos Areces & Diana Costa, Dynamic Logic. New Trends and Applications: 4th International Workshop, DaLí 2022, Haifa, Israel, July 31–August 1, 2022, Revised Selected Papers. Springer Verlag. pp. 125-153.
    We extend epistemic stit theory with a modality \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I_\alpha \varphi $$\end{document}, meant to express that at some moment agent \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document} had a present-directed intention toward the realization of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document}. The semantics is based on the extension of stit frames with special topologies associated to agents. The open sets of the associated topology (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  24.  86
    Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals.Dov M. Gabbay & Andrzej Szałas - 2007 - Studia Logica 87 (1):37-50.
    Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  25. A mechanization of sorted higher-order logic based on the resolution principle.Michael Kohlhase - unknown
    The usage of sorts in first-order automated deduction has brought greater conciseness of representation and a considerable gain in efficiency by reducing the search spaces involved. This suggests that sort information can be employed in higher-order theorem proving with similar results.
     
    Export citation  
     
    Bookmark   8 citations  
  26.  56
    Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
    Semantical arguments, based on the completeness theorem for first-order logic, give elegant proofs of purely syntactical results. For instance, for proving a conservativity theorem between two theories, one shows instead that any model of one theory can be extended to a model of the other theory. This method of proof, because of its use of the completeness theorem, is a priori not valid constructively. We show here how to give similar arguments, valid constructively, by using Boolean models. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  27.  30
    Theorem proving with built-in hybrid theories.Uwe Petermann - 1998 - Logic and Logical Philosophy 6:77.
    A growing number of applications of automated reasoning exhibitsthe necessity of flexible deduction systems. A deduction system should beable to execute inference rules which are appropriate to the given problem.One way to achieve this behavior is the integration of different calculi. Thisled to so called hybrid reasoning [22, 1, 10, 20] which means the integrationof a general purpose foreground reasoner with a specialized background reasoner. A typical task of a background reasoner is to perform special purposeinference rules according to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28.  22
    Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic.Alexander Steen & Christoph Benzmüller - 2016 - Logic and Logical Philosophy 25 (4):535-554.
    An embedding of many-valued logics based on SIXTEEN in classical higher-order logic is presented. SIXTEEN generalizes the four-valued set of truth degrees of Dunn/Belnap’s system to a lattice of sixteen truth degrees with multiple distinct ordering relations between them. The theoretical motivation is to demonstrate that many-valued logics, like other non-classical logics, can be elegantly modeled (and even combined) as fragments of classical higher-order logic. Equally relevant are the pragmatic aspects of the presented approach: (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Identity in modal logic theorem proving.Francis J. Pelletier - 1993 - Studia Logica 52 (2):291 - 308.
    THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an indirect semantic method, obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logic, and issues concerning the domain of quantification and existence in a world's domain are (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Higher-Order Sorites Paradox.Elia Zardini - 2013 - Journal of Philosophical Logic 42 (1):25-48.
    The naive theory of vagueness holds that the vagueness of an expression consists in its failure to draw a sharp boundary between positive and negative cases. The naive theory is contrasted with the nowadays dominant approach to vagueness, holding that the vagueness of an expression consists in its presenting borderline cases of application. The two approaches are briefly compared in their respective explanations of a paramount phenomenon of vagueness: our ignorance of any sharp boundary between positive and negative cases. These (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  31. Higher-Order Modal Logic—A Sketch.Melvin Fitting - unknown
    First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal (...): its formal semantics, and a proof procedure using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in G¨ odel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation. (shrink)
     
    Export citation  
     
    Bookmark  
  32.  22
    Introduction to Higher Order Categorical Logic.Joachim Lambek & Philip J. Scott - 1986 - Cambridge University Press.
    In this book the authors reconcile two different viewpoints of the foundations of mathematics, namely mathematical logic and category theory. In Part I, they show that typed lambda-calculi, a formulation of higher order logic, and cartesian closed categories are essentially the same. In Part II, it is demonstrated that another formulation of higher order logic is closely related to topos theory. Part III is devoted to recursive functions. Numerous applications of the close (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  33.  27
    Refining the Taming of the Reverse Mathematics Zoo.Sam Sanders - 2018 - Notre Dame Journal of Formal Logic 59 (4):579-597.
    Reverse mathematics is a program in the foundations of mathematics. It provides an elegant classification in which the majority of theorems of ordinary mathematics fall into only five categories, based on the “big five” logical systems. Recently, a lot of effort has been directed toward finding exceptional theorems, that is, those which fall outside the big five. The so-called reverse mathematics zoo is a collection of such exceptional theorems. It was previously shown that a number of uniform versions of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34. Comparing Approaches To Resolution Based Higher-Order Theorem Proving.Christoph Benzmüller - 2002 - Synthese 133 (1-2):203-335.
    We investigate several approaches to resolution based automated theoremproving in classical higher-order logic (based on Church's simply typedλ-calculus) and discuss their requirements with respect to Henkincompleteness and full extensionality. In particular we focus on Andrews' higher-order resolution (Andrews 1971), Huet's constrained resolution (Huet1972), higher-order E-resolution, and extensional higher-order resolution(Benzmüller and Kohlhase 1997). With the help of examples we illustratethe parallels and differences of the extensionality treatment of these approachesand demonstrate that extensional (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35. Grande Sertão: Veredas by João Guimarães Rosa.Felipe W. Martinez, Nancy Fumero & Ben Segal - 2013 - Continent 3 (1):27-43.
    INTRODUCTION BY NANCY FUMERO What is a translation that stalls comprehension? That, when read, parsed, obfuscates comprehension through any language – English, Portuguese. It is inevitable that readers expect fidelity from translations. That language mirror with a sort of precision that enables the reader to become of another location, condition, to grasp in English in a similar vein as readers of Portuguese might from João Guimarães Rosa’s GRANDE SERTÃO: VEREDAS. There is the expectation that translations enable mobility. That what was (...)
     
    Export citation  
     
    Bookmark  
  36. Prove it! The Burden of Proof Game in Science vs. Pseudoscience Disputes.Massimo Pigliucci & Maarten Boudry - 2014 - Philosophia 42 (2):487-502.
    The concept of burden of proof is used in a wide range of discourses, from philosophy to law, science, skepticism, and even in everyday reasoning. This paper provides an analysis of the proper deployment of burden of proof, focusing in particular on skeptical discussions of pseudoscience and the paranormal, where burden of proof assignments are most poignant and relatively clear-cut. We argue that burden of proof is often misapplied or used as a mere rhetorical gambit, with little appreciation of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  37.  26
    Frontiers of combining systems: 4th international workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002: proceedings.Alessandro Armando (ed.) - 2002 - New York: Springer.
    This book constitutes the refereed proceedings of the 4th International Conference on Frontiers of Combining Systems, FroCoS 2002, held in Santa Margherita Ligure, Italy, in April 2002.The 14 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 35 submissions. Among the topics covered are combination of logics, combination of constraint solving techniques, combination of decision procedures, combination problems in verification, modular problems of theorem proving, and the integration of decision procedures and other (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  50
    International AID From the Moral Case, to Everyday Life Experiences.Ana-Maria Pascal - 2005 - Cultura 2 (2):154-171.
    As its title is meant to suggest, this paper is a reply to Sir Tim Lankester’s article “International Aid: Experience, Prospects and the Moral Case”, published in the World Economics last year 1 . Therefore, I would like to begin by expressing my gratitude for the author’s responsiveness to my interest and queries in the area of development economics. The main point of Sir Lankester’s article was, I believe, to strengthen the case for international aid by showing first, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  39.  10
    Modern Uses of Multiple-Valued Logic: Invited Papers From the Fifth International Symposium on Multiple-Valued Logic Held at Indiana University, Bloomington, Indiana, May 13–16, 1975.J. Michael Dunn & George Epstein (eds.) - 1977 - Dordrecht, Netherland: Springer.
    This is a collection of invited papers from the 1975 International Sym posium on Multiple-valued Logic. Also included is an extensive bib liography of works in the field of multiple-valued logic prior to 1975 - this supplements and extends an earlier bibliography of works prior to 1965, by Nicholas Rescher in his book Many-Valued Logic, McGraw-Hill, 1969. There are a number of possible reasons for interest in the present volume. First, the range of various uses covered (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  25
    Frontiers of combining systems: third international workshop, FroCoS 2000, Nancy, France, March 22-24, 2000: proceedings.Helene Kirchner & Christophe Ringeissen (eds.) - 2000 - New York: Springer.
    This book constitutes the refereed proceedings of the Third International Workshop on Frontiers of Combining Systems, FroCoS 2000, held in Nancy, France, in March 2000.The 14 revised full papers presented together with four invited papers were carefully reviewed and selected from a total of 31 submissions. Among the topics covered are constraint processing, interval narrowing, rewriting systems, proof planning, sequent calculus, type systems, model checking, theorem proving, declarative programming, logic programming, and equational theories.
    Direct download  
     
    Export citation  
     
    Bookmark  
  41. David Bostock.On Motivating Higher-Order Logic - 2004 - In Thomas Baldwin & Timothy Smiley, Studies in the Philosophy of Logic and Knowledge. New York: Oup/British Academy.
    No categories
     
    Export citation  
     
    Bookmark  
  42. Higher-Order Vagueness for Partially Defined Predicates.Scott Soames - 2003 - In J. C. Beall, Liars and Heaps: New Essays on Paradox. Oxford, England: Oxford University Press UK.
    A theory of higher-order vagueness for partially-defined, context-sensitive predicates like is blue is offered. According to the theory, the predicate is determinately blue means roughly is an object o such that the claim that o is blue is a necessary consequence of the rules of the language plus the underlying non-linguistic facts in the world. Because the question of which rules count as rules of the language is itself vague, the predicate is determinately blue is both vague and (...)
     
    Export citation  
     
    Bookmark   12 citations  
  43. Demoting higher-order vagueness.Diana Raffman - 2010 - In Richard Dietz & Sebastiano Moruzzi, Cuts and clouds: vagueness, its nature, and its logic. New York: Oxford University Press. pp. 509--22.
    Higher-order vagueness is widely thought to be a feature of vague predicates that any adequate theory of vagueness must accommodate. It takes a variety of forms. Perhaps the most familiar is the supposed existence, or at least possibility, of higher-order borderline cases—borderline borderline cases, borderline borderline borderline cases, and so forth. A second form of higherorder vagueness, what I will call ‘prescriptive’ higher-order vagueness, is thought to characterize complex predicates constructed from vague predicates by (...)
     
    Export citation  
     
    Bookmark   8 citations  
  44.  25
    An algebraic theory of normal forms.Silvio Ghilardi - 1995 - Annals of Pure and Applied Logic 71 (3):189-245.
    In this paper we present a general theory of normal forms, based on a categorial result for the free monoid construction. We shall use the theory mainly for proposictional modal logic, although it seems to have a wider range of applications. We shall formally represent normal forms as combinatorial objects, basically labelled trees and forests. This geometric conceptualization is implicit in and our approach will extend it to other cases and make it more direct: operations of a purely (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  45.  23
    Robert Trueman’s Defence of Higher-Order Logic.Marcin Tkaczyk - 2024 - Logic and Logical Philosophy 33 (1):163-168.
    The paper contains a review and a discussion of Robert Trueman's book Properties and Propositions: The Metaphysics of Higher-Order Logic, Cambridge University Press, 2021, pp. xii + 227. ISBN 978-1-108-81410-2. The discussion is focused on the consistency of Truema's language-based ontology and on its value in defending higher-order logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. A higher order Bayesian decision theory of consciousness.Hakwan Lau - 2008 - In Rahul Banerjee & Bikas K. Chakrabarti, Models of brain and mind: physical, computational, and psychological approaches. Boston: Elsevier.
    It is usually taken as given that consciousness involves superior or more elaborate forms of information processing. Contemporary models equate consciousness with global processing, system complexity, or depth or stability of computation. This is in stark contrast with the powerful philosophical intuition that being conscious is more than just having the ability to compute. I argue that it is also incompatible with current empirical findings. I present a model that is free from the strong assumption that consciousness predicts superior performance. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   33 citations  
  47. Higher-Order Contingentism, Part 3: Expressive Limitations.Peter Fritz - 2018 - Journal of Philosophical Logic 47 (4):649-671.
    Two expressive limitations of an infinitary higher-order modal language interpreted on models for higher-order contingentism – the thesis that it is contingent what propositions, properties and relations there are – are established: First, the inexpressibility of certain relations, which leads to the fact that certain model-theoretic existence conditions for relations cannot equivalently be reformulated in terms of being expressible in such a language. Second, the inexpressibility of certain modalized cardinality claims, which shows that in such a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  48. Higher-Order Discrimination.Adrian M. S. Piper - 1990 - In Rorty Amelie O. & Flanagan Owen, Identity, Character and Morality. MIT Press. pp. 285-309.
    This discussion treats a set of familiar social derelictions as consequences of the perversion of a universalistic moral theory in the service of an ill-considered or insufficiently examined personal agenda.The set includes racism, sexism, anti-Semitism, homophobia, and class elitism, among other similar pathologies, under the general heading of discrimination. The perversion of moral theory from which these derelictions arise, I argue, involves restricting its scope of application to some preferred subgroup of the moral community of human beings. -/- The following (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  49.  81
    On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
    We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together with the relation of such games of imperfect information to higher-order logic. Finally, a set of (...) will be outlined. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  50. Higher-Order Multi-Valued Resolution.Michael Kohlhase - 1999 - Journal of Applied Non-Classical Logics 9 (4):455-477.
    ABSTRACT This paper introduces a multi-valued variant of higher-order resolution and proves it correct and complete with respect to a variant of Henkin's general model semantics. This resolution method is parametric in the number of truth values as well as in the particular choice of the set of connectives (given by arbitrary truth tables) and even substitutional quantifiers. In the course of the completeness proof we establish a model existence theorem for this logical system. The work reported in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 975