Search results for 'Predicate' (try it on Scholar)

1000+ found
Order:
  1.  37
    M. J. Cresswell (2013). Predicate Metric Tense Logic for 'Now' and 'Then'. Journal of Philosophical Logic 42 (1):1-24.
    In a number of publications A.N. Prior considered the use of what he called ‘metric tense logic’. This is a tense logic in which the past and future operators P and F have an index representing a temporal distance, so that Pnα means that α was true n -much ago, and Fn α means that α will be true n -much hence. The paper investigates the use of metric predicate tense logic in formalising phenomena ormally treated by such devices (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  2.  47
    James R. Hurford (2003). The Neural Basis of Predicate-Argument Structure. Behavioral and Brain Sciences 26 (3):261-283.
    Neural correlates exist for a basic component of logical formulae, PREDICATE(x). Vision and audition research in primates and humans shows two independent neural pathways; one locates objects in body-centered space, the other attributes properties, such as colour, to objects. In vision these are the dorsal and ventral pathways. In audition, similarly separable “where” and “what” pathways exist. PREDICATE(x) is a schematic representation of the brain's integration of the two processes of delivery by the senses of the location of (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  3.  27
    Pilar Dellunde & Francesc Esteva (2013). On Elementary Equivalence in Fuzzy Predicate Logics. Archive for Mathematical Logic 52 (1-2):1-17.
    Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  15
    Victor N. Krivtsov (2010). An Intuitionistic Completeness Theorem for Classical Predicate Logic. Studia Logica 96 (1):109 - 115.
    This paper presents an intuitionistic proof of a statement which under a classical reading is logically equivalent to Gödel's completeness theorem for classical predicate logic.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  32
    Albert Visser (1998). Contexts in Dynamic Predicate Logic. Journal of Logic, Language and Information 7 (1):21-52.
    In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6.  66
    Philip Percival (2011). Predicate Abstraction, the Limits of Quantification, and the Modality of Existence. Philosophical Studies 156 (3):389-416.
    For various reasons several authors have enriched classical first order syntax by adding a predicate abstraction operator. “Conservatives” have done so without disturbing the syntax of the formal quantifiers but “revisionists” have argued that predicate abstraction motivates the universal quantifier’s re-classification from an expression that combines with a variable to yield a sentence from a sentence, to an expression that combines with a one-place predicate to yield a sentence. My main aim is to advance the cause of (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  7.  30
    Bert Mosselmans (2008). Aristotle's Logic and the Quest for the Quantification of the Predicate. Foundations of Science 13 (3-4):195-198.
    This paper examines the quest for the quantification of the predicate, as discussed by W.S. Jevons, and relates it to the discussion about universals and particulars between Plato and Aristotle. We conclude that the quest for the quantification of the predicate can only be achieved by stripping the syllogism from its metaphysical heritage.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  48
    Hajime Yoshino (1997). On the Logical Foundations of Compound Predicate Formulae for Legal Knowledge Representation. Artificial Intelligence and Law 5 (1-2):77-96.
    In order to represent legal knowledge adequately, it is vital to create a formal device that can freely construct an individual concept directly from a predicate expression. For this purpose, a Compound Predicate Formula (CPF) is formulated for use in legal expert systems. In this paper, we willattempt to explain the nature of CPFs by rigorous logical foundation, i.e., establishing their syntax and semantics precisely through the use of appropriate examples. We note the advantages of our system over (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9.  10
    Susan Goldin‐Meadow (2015). The Impact of Time on Predicate Forms in the Manual Modality: Signers, Homesigners, and Silent Gesturers. Topics in Cognitive Science 7 (1):169-184.
    It is difficult to create spoken forms that can be understood on the spot. But the manual modality, in large part because of its iconic potential, allows us to construct forms that are immediately understood, thus requiring essentially no time to develop. This paper contrasts manual forms for actions produced over three time spans—by silent gesturers who are asked to invent gestures on the spot; by homesigners who have created gesture systems over their life spans; and by signers who have (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  10.  39
    Kai Brünnler (2006). Cut Elimination Inside a Deep Inference System for Classical Predicate Logic. Studia Logica 82 (1):51 - 71.
    Deep inference is a natural generalisation of the one-sided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are difficult or impossible to express in the cut-free sequent calculus and it also allows for a more fine-grained analysis of derivations than the sequent calculus. However, the same freedom also makes it harder to carry out this analysis, in particular it (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  11.  12
    Hadi Farahani & Hiroakira Ono (2012). Glivenko Theorems and Negative Translations in Substructural Predicate Logics. Archive for Mathematical Logic 51 (7-8):695-707.
    Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFL e . It is shown that there exists the weakest logic over QFL e among substructural predicate logics for which the Glivenko theorem holds. Negative translations (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  12.  20
    Hiroakira Ono (2012). Crawley Completions of Residuated Lattices and Algebraic Completeness of Substructural Predicate Logics. Studia Logica 100 (1-2):339-359.
    This paper discusses Crawley completions of residuated lattices. While MacNeille completions have been studied recently in relation to logic, Crawley completions (i.e. complete ideal completions), which are another kind of regular completions, have not been discussed much in this relation while many important algebraic works on Crawley completions had been done until the end of the 70’s. In this paper, basic algebraic properties of ideal completions and Crawley completions of residuated lattices are studied first in their conncetion with the join (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  13.  7
    Taishi Kurahashi (2013). On Predicate Provability Logics and Binumerations of Fragments of Peano Arithmetic. Archive for Mathematical Logic 52 (7-8):871-880.
    Solovay proved (Israel J Math 25(3–4):287–304, 1976) that the propositional provability logic of any ∑2-sound recursively enumerable extension of PA is characterized by the propositional modal logic GL. By contrast, Montagna proved in (Notre Dame J Form Log 25(2):179–189, 1984) that predicate provability logics of Peano arithmetic and Bernays–Gödel set theory are different. Moreover, Artemov proved in (Doklady Akademii Nauk SSSR 290(6):1289–1292, 1986) that the predicate provability logic of a theory essentially depends on the choice of a binumeration (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  14.  11
    Christine Gaßner (1994). The Axiom of Choice in Second‐Order Predicate Logic. Mathematical Logic Quarterly 40 (4):533-546.
    The present article deals with the power of the axiom of choice within the second-order predicate logic. We investigate the relationship between several variants of AC and some other statements, known as equivalent to AC within the set theory of Zermelo and Fraenkel with atoms, in Henkin models of the one-sorted second-order predicate logic with identity without operation variables. The construction of models follows the ideas of Fraenkel and Mostowski. It is e. g. shown that the well-ordering theorem (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  15.  9
    F. Sauri (1998). Bradley's Supposed Rejection of Subject-Predicate Judgements. Bradley Studies 4 (1):102-112.
    Textual evidence normally quoted to justify the claim that F. H. Bradley rejects subject - predicate judgements has other functions: namely to reject concrete interpretations of subject - predicate judgements. Bradley has his own view of subject - predicate judgement: in a judgement subject and predicate forma an adjetive which is predicated of the whole reality.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  16.  12
    Dmitrij Skvortsov (2012). Kripke Sheaf Completeness of Some Superintuitionistic Predicate Logics with a Weakened Constant Domains Principle. Studia Logica 100 (1-2):361-383.
    The completeness w.r.t. Kripke frames with equality (or, equivalently, w.r.t. Kripke sheaves, [ 8 ] or [4, Sect. 3.6]) is established for three superintuitionistic predicate logics: ( Q - H + D *), ( Q - H + D *&K), ( Q - H + D *& K & J ). Here Q - H is intuitionistic predicate logic, J is the principle of the weak excluded middle, K is Kuroda’s axiom, and D * (cf. [ 12 ]) (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  17.  16
    Ernst Zimmermann (2009). Predicate Logical Extensions of Some Subintuitionistic Logics. Studia Logica 91 (1):131 - 138.
    The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation, which is a partial order, for the interpretation of the universal quantifier.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  18.  3
    Victor N. Krivtsov (2015). Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem. Studia Logica 103 (3):623-638.
    Within a weak system \ of intuitionistic analysis one may prove, using the Weak Fan Theorem as an additional axiom, a completeness theorem for intuitionistic first-order predicate logic relative to validity in generalized Beth models as well as a completeness theorem for classical first-order predicate logic relative to validity in intuitionistic structures. Conversely, each of these theorems implies over \ the Weak Fan Theorem.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19.  3
    Olivier Gasquet (1998). Predicate Modal Logics Do Not Mix Very Well. Mathematical Logic Quarterly 44 (1):45-49.
    The problem of completeness for predicate modal logics is still under investigation, although some results have been obtained in the last few years . As far as we know, the case of multimodal logics has not been addressed at all. In this paper, we study the combination of modal logics in terms of combining their semantics. We demonstrate by a simple example that in this sense predicate modal logics are not so easily manipulated as propositional ones: mixing two (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  20.  44
    P. F. Strawson (2004). Subject and Predicate in Logic and Grammar. Ashgate.
    P.F. Strawson's essay traces some formal characteristics of logic and grammar to their roots in general features of thought and experience.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   30 citations  
  21.  11
    Franco Montagna (2005). On the Predicate Logics of Continuous T-Norm BL-Algebras. Archive for Mathematical Logic 44 (1):97-114.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  22. Michael Durrant & Stephen Horton (2001). Sortals and the Subject-Predicate Distinction. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography   1 citation  
  23. W. V. Quine (1971). Algebraic Logic and Predicate Functors. [Indianapolis,Bobbs-Merrill.
     
    Export citation  
     
    My bibliography   3 citations  
  24.  20
    Jonathan Fleischmann (2010). Syntactic Preservation Theorems for Intuitionistic Predicate Logic. Notre Dame Journal of Formal Logic 51 (2):225-245.
    We define notions of homomorphism, submodel, and sandwich of Kripke models, and we define two syntactic operators analogous to universal and existential closure. Then we prove an intuitionistic analogue of the generalized (dual of the) Lyndon-Łoś-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models, an intuitionistic analogue of the generalized Łoś-Tarski Theorem, which characterizes the sentences preserved under submodels of Kripke models, and an intuitionistic analogue of the generalized Keisler Sandwich Theorem, which characterizes the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25.  1
    Kenneth A. Bowen (1981). Model Theory for Modal Logic. Kripke Models for Modal Predicate Calculi. Journal of Symbolic Logic 46 (2):415-417.
    Direct download  
     
    Export citation  
     
    My bibliography  
  26. Ernest G. Manes (1992). Predicate Transformer Semantics. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography  
  27. Robert Mattison (1968). An Introduction to the Model Theory of First-Order Predicate Logic and a Related Temporal Logic. Santa Monica, Calif.,Rand Corp..
  28. David A. Plaisted (1979). Complete Problems in the First-Order Predicate Calculus. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
     
    Export citation  
     
    My bibliography  
  29. Howard Pospesel (1976). Predicate Logic.
     
    Export citation  
     
    My bibliography  
  30. Sueli Mendes dos Santos (1972). Automatic Proofs for Theorems on Predicate Calculus. [Rio De Janeiro,Pontificia Universidade Católica Do Rio De Janeiro].
     
    Export citation  
     
    My bibliography  
  31. S. Christiaan van Westrhenen (1969). The Statistical Estimation of Provability in the First Order Predicate Calculus. [Eindhoven, Technische Hogeschool (Inslindelaan 2).
     
    Export citation  
     
    My bibliography  
  32. Jeroen Groenendijk & Martin Stokhof (1991). Dynamic Predicate Logic. Linguistics and Philosophy 14 (1):39-100.
    This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do away with the principle (...)
    Direct download (11 more)  
     
    Export citation  
     
    My bibliography   108 citations  
  33.  23
    Stefano Predelli (2015). Who’s Afraid of the Predicate Theory of Names? Linguistics and Philosophy 38 (4):363-376.
    This essay is devoted to an analysis of the semantic significance of a fashionable view of proper names, the Predicate Theory of names, typically developed in the direction of the Metalinguistic Theory of names. According to MT, ‘syntactic evidence supports the conclusion that a name such as ‘Kennedy’ is analyzable in terms of the predicate ‘individual named ‘Kennedy’’. This analysis is in turn alleged to support a descriptivist treatment of proper names in designative position, presumably in contrast with (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  34.  37
    Dolf Rami (2013). On the Unification Argument for the Predicate View on Proper Names. Synthese 191 (5):1-22.
    The predicate view on proper names opts for a uniform semantic representation of proper nouns like ‘Alfred’ as predicates on the level of logical form. Early defences of this view can be found in Sloat (Language, vol. 45, pp. 26–30, 1969) and Burge (J. Philos. 70: 425–439, 1973), but there is an increasing more recent interest in this view on proper names. My paper aims to provide a reconstruction and critique of Burge’s main argument for the predicate view (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  35.  37
    Hajnal Andréka, István Németi & Johan van Benthem (1998). Modal Languages and Bounded Fragments of Predicate Logic. Journal of Philosophical Logic 27 (3):217-274.
    What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   25 citations  
  36.  13
    Petr Hájek & Petr Cintula (2006). On Theories and Models in Fuzzy Predicate Logics. Journal of Symbolic Logic 71 (3):863 - 880.
    In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  37.  28
    Kent Bach (2015). The Predicate View of Proper Names. Philosophy Compass 10 (11):772-784.
    The Millian view that the meaning of a proper name is simply its referent has long been popular among philosophers of language. It might even be deemed the orthodox view, despite its well-known difficulties. Fregean and Russellian alternatives, though widely discussed, are much less popular. The Predicate View has not even been taken seriously, at least until fairly recently, but finally, it is receiving the attention it deserves. It says that a name expresses the property of bearing that name. (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  38.  36
    Stefano Predelli (2015). Who’s Afraid of the Predicate Theory of Names? Linguistics and Philosophy 38 (4):363-376.
    This essay is devoted to an analysis of the semantic significance of a fashionable view of proper names, the Predicate Theory of names, typically developed in the direction of the Metalinguistic Theory of names. According to MT, ‘syntactic evidence supports the conclusion that a name such as ‘Kennedy’ is analyzable in terms of the predicate ‘individual named ‘Kennedy’’. This analysis is in turn alleged to support a descriptivist treatment of proper names in designative position, presumably in contrast with (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39.  36
    M. J. Hill, J. B. Paris & G. M. Wilmers (2002). Some Observations on Induction in Predicate Probabilistic Reasoning. Journal of Philosophical Logic 31 (1):43-75.
    We consider the desirability, or otherwise, of various forms of induction in the light of certain principles and inductive methods within predicate uncertain reasoning. Our general conclusion is that there remain conflicts within the area whose resolution will require a deeper understanding of the fundamental relationship between individuals and properties.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  40. Pierluigi Minari, Mitio Takano & Hiroakira Ono (1990). Intermediate Predicate Logics Determined by Ordinals. Journal of Symbolic Logic 55 (3):1099-1124.
    For each ordinal $\alpha > 0, L(\alpha)$ is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable $\eta (> 0)$ , there exists a countable ordinal of the form β + η such that (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  41.  85
    Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani & Pierangelo Miglioli (1996). On Maximal Intermediate Predicate Constructive Logics. Studia Logica 57 (2-3):373 - 408.
    We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal intermediate predicate constructive logics, yet leaving open the problem of stating whether the two logics are distinct. Further properties of these logics will (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  42.  53
    Kai Wehmeier (2004). Wittgensteinian Predicate Logic. Notre Dame Journal of Formal Logic 45 (1):1-11.
    We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  43. Arvid Båve (2009). Why is a Truth-Predicate Like a Pronoun? Philosophical Studies 145 (2):297 - 310.
    I begin with an exposition of the two main variants of the Prosentential Theory of Truth (PT), those of Dorothy Grover et al. and Robert Brandom. Three main types of criticisms are then put forward: (1) material criticisms to the effect that (PT) does not adequately explain the linguistic data, (2) an objection to the effect that no variant of (PT) gives a properly unified account of the various occurrences of "true" in English, and, most importantly, (3) a charge that (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  44.  51
    Stefan Wölfl (1999). Combinations of Tense and Modality for Predicate Logic. Journal of Philosophical Logic 28 (4):371-398.
    In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  45.  38
    C. F. M. Vermeulen (1993). Sequence Semantics for Dynamic Predicate Logic. Journal of Logic, Language and Information 2 (3):217-254.
    In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown that the refined semantics reflects out intuitions about information growth. Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  46.  79
    James Hawthorne (1998). On the Logic of Nonmonotonic Conditionals and Conditional Probabilities: Predicate Logic. [REVIEW] Journal of Philosophical Logic 27 (1):1-34.
    In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is closely related to Hartry Field's probabilistic semantics. Along the way I will show how Field's semantics differs from a substitutional (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  47.  83
    Maria Aloni (2005). Individual Concepts in Modal Predicate Logic. Journal of Philosophical Logic 34 (1):1 - 64.
    The article deals with the interpretation of propositional attitudes in the framework of modal predicate logic. The first part discusses the classical puzzles arising from the interplay between propositional attitudes, quantifiers and the notion of identity. After comparing different reactions to these puzzles it argues in favor of an analysis in which evaluations of de re attitudes may vary relative to the ways of identifying objects used in the context of use. The second part of the article gives this (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  48.  61
    Thomas J. McQuade (1994). From Syllogism to Predicate Calculus. Teaching Philosophy 17 (4):293-309.
    The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. The (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  49.  23
    Tatsuya Shimura (1993). Kripke Completeness of Some Intermediate Predicate Logics with the Axiom of Constant Domain and a Variant of Canonical Formulas. Studia Logica 52 (1):23 - 40.
    For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  50.  17
    Jürgen Landes & Jon Williamson, Justifying Objective Bayesianism on Predicate Languages.
    Objective Bayesianism says that the strengths of one’s beliefs ought to be probabilities, calibrated to physical probabilities insofar as one has evidence of them, and otherwise sufficiently equivocal. These norms of belief are often explicated using the maximum entropy principle. In this paper we investigate the extent to which one can provide a unified justification of the objective Bayesian norms in the case in which the background language is a first-order predicate language, with a view to applying the resulting (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000