- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: Citations
References in:
A Computational Learning Semantics for Inductive Empirical Knowledge
In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337 (2014)
Add references
You must login to add references.
|
|
|
Overview of fundamental work in deontic logic. |
|
|
This paper presents an attempt to bridge the gap between logical and cognitive treatments of strategic reasoning in games. There have been extensive formal debates about the merits of the principle of backward induction among game theorists and logicians. Experimental economists and psychologists have shown that human subjects, perhaps due to their bounded resources, do not always follow the backward induction strategy, leading to unexpected outcomes. Recently, based on an eye-tracking study, it has turned out that even human subjects who (...) |
|
|
|
|
|
Simplicity has long been recognized as an apparent mark of truth in science, but it is difficult to explain why simplicity should be accorded such weight. This chapter examines some standard, statistical explanations of the role of simplicity in scientific method and argues that none of them explains, without circularity, how a reliance on simplicity could be conducive to finding true models or theories. The discussion then turns to a less familiar approach that does explain, in a sense, the elusive (...) |
|
|
Bayesianism claims to provide a unified theory of epistemic and practical rationality based on the principle of mathematical expectation. In its epistemic guise it requires believers to obey the laws of probability. In its practical guise it asks agents to maximize their subjective expected utility. Joyce’s primary concern is Bayesian epistemology, and its five pillars: people have beliefs and conditional beliefs that come in varying gradations of strength; a person believes a proposition strongly to the extent that she presupposes its (...) |
|
|
We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...) |
|
|
In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts. |
|
|
In the topological semantics for modal logic, S4 is well-known to be complete for the rational line, for the real line, and for Cantor space: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but also strongly complete, for the rational line. But no similarly easy amendment is available for the real line or for Cantor space and the question (...) |
|
|
Questions are triggers for explicit events of ‘issue management’. We give a complete logic in dynamic-epistemic style for events of raising, refining, and resolving an issue, all in the presence of information flow through observation or communication. We explore extensions of the framework to multi-agent scenarios and long-term temporal protocols. We sketch a comparison with some alternative accounts. |
|
|
This paper is an amalgam of physics and mathematical logic. It contains an elementary axiomatization of spacetime in terms of the primitive concepts of particle, signal, and transmission and reception. In the elementary language formed with these predicates we state AxiomsE, C, andU, which are naturally interpretable as basic physical properties of particles and signals. We then determine all mathematical models of this axiom system; these represent certain generalizations of the standard model. Also, the automorphism groups of the models are (...) |
|
|
This is identical with the first edition (see 21: 2716) except for the addition of a Supplement containing 5 previously published articles and the bringing of the bibliography (now 73 items) up to date. The 5 added articles present clarifications or modifications of views expressed in the first edition. (PsycINFO Database Record (c) 2009 APA, all rights reserved). |
|
|
The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) |
|
|
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369). |
|
|
In this paper we investigate Kripke models, used to model knowledge or belief in a static situation, and action models, used to model communicative actions that change this knowledge or belief. The appropriate notion for structural equivalence between modal structures such as Kripke models is bisimulation: Kripke models that are bisimilar are modally equivalent. We would like to find a structural relation that can play the same role for the action models that play a prominent role in information updating. Two (...) |
|
|
Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...) |
|
|
One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) |
|
|
Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents do (...) |
|
|
Externalists in epistemology often reject the KK principle – which says that if a person knows that p, then they know that they know that p. This paper argues that one standard argument against the KK principle that many externalists make is fallacious, as it involves illicit substitution into an intensional context. The fallacy is exposed and discussed. |
|
|
Counterfactual attitudes like imagining, dreaming, and wishing create a problem for the standard formal semantic theory of de re attitude ascriptions. I show how the problem can be avoided if we represent an agent's attitudinal possibilities using "multi-centered worlds", possible worlds with multiple distinguished individuals, each of which represents an individual with whom the agent is acquainted. I then present a compositional semantics for de re ascriptions according to which singular terms are "assignment-sensitive" expressions and attitude verbs are "assignment shifters". |
|
|
This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the ?extensions? of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth (...) |
|
|
We present a streamlined axiom system of special relativity in first-order logic. From this axiom system we "derive" an axiom system of general relativity in two natural steps. We will also see how the axioms of special relativity transform into those of general relativity. This way we hope to make general relativity more accessible for the non-specialist. |
|
|
This paper studies the Lockean thesis from the perspective of contemporary epistemic logic. The Lockean thesis states that belief can be defined as ‘sufficiently high degree of belief’. Its main problem is that it gives rise to a notion of belief which is not closed under conjunction. This problem is typical for classical epistemic logic: it is single-agent and static. I argue that from the perspective of contemporary epistemic logic, the Lockean thesis fares much better. I briefly mention that it (...) |
|
|
Discourse dynamics, pragmatics, and indefinites Content Type Journal Article Pages 1-30 DOI 10.1007/s11098-012-9882-y Authors Karen S. Lewis, Department of Philosophy, University of Southern California, Los Angeles, CA, USA Journal Philosophical Studies Online ISSN 1573-0883 Print ISSN 0031-8116. |
|
|
It is common to assume that the problem of induction arises only because of small sample sizes or unreliable data. In this paper, I argue that the piecemeal collection of data can also lead to underdetermination of theories by evidence, even if arbitrarily large amounts of completely reliable experimental and observational data are collected. Specifically, I focus on the construction of causal theories from the results of many studies (perhaps hundreds), including randomized controlled trials and observational studies, where the studies (...) |
|
|
|
|
|
This is also where we begin investigating lattices of logics and varieties, rather than particular examples. |
|
|
|
|
|
|
|
|
|
|
|
Sets out the basic theory of normal modal and temporal propositional logics; applies this theory to logics of discrete (integer), dense (rational), and continuous (real) time, to the temporal logic of henceforth, next, and until, and to the propositional dynamic logic of regular programs. |
|
|
what is now the mainstream view as to the best way forward in the dream of engineering reliable software systems out of autonomous agents. The way of using formal logics to specify, implement and verify distributed systems of interacting units using a guiding analogy of beliefs, desires and intentions. The implicit message behind the book is this: Distributed Artificial Intelligence (DAI) can be a respectable engineering science. It says: we use sound formal systems; can cite established philosophical foundations; and will (...) |
|
|
Probability, Frequency and Reasonable Expectation. |
|
|
When one looks into the role of artificial languages in philosophy of language it seems appropriate to start with making a distinction between philosophy of language proper and formal semantics of natural language. Although the distinction between the two disciplines may not always be easy to make since there arguably exist substantial historical and systematic relationships between the two, it nevertheless pays to keep the two apart, at least initially, since the motivation commonly given for the use of artificial languages (...) |
|
|
Many logical systems today describe intelligent interacting agents over time. Frameworks include Interpreted Systems (IS, Fagin et al. [8]), Epistemic-Temporal Logic (ETL, Parikh & Ramanujam [22]), STIT (Belnap et al. [5]), Process Algebra and Game Semantics (Abramsky [1]). This variety is an asset, as different modeling tools can be fine-tuned to specific applications. But it may also be an obstacle, when barriers between paradigms and schools go up. This paper takes a closer look at one particular interface, between two systems (...) |
|
|
Statements not only update our current knowledge, but also have other dynamic effects. In particular, suggestions or commands ?upgrade' our preferences by changing the current order among worlds. We present a complete logic of knowledge update plus preference upgrade that works with dynamic-epistemic-style reduction axioms. This system can model changing obligations, conflicting commands, or ?regret'. We then show how to derive reduction axioms from arbitrary definable relation changes. This style of analysis also has a product update version with preferences between (...) |
|
|
Edmund Gettier is Professor Emeritus at the University of Massachusetts, Amherst. This short piece, published in 1963, seemed to many decisively to refute an otherwise attractive analysis of knowledge. It stimulated a renewed effort, still ongoing, to clarify exactly what knowledge comprises. |
|
|
|
|
|
|
|
|
The paper identifies some background assumptions of compositionality in formal semantics and investigates how they shape formal semantics as a scientific discipline. |
|
|
|
|
|
|
|
|
We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if. |
|
|
We investigate the effect on the complexity of adding the universal modality and the reflexive transitive closure modality to modal logics. From the examples in the literature, one might conjecture that adding the reflexive transitive closure modality is at least as hard as adding the universal modality, and that adding either of these modalities to a multi-modal logic where the modalities do not interact can only increase the complexity to EXPTIME-complete. We show that the first conjecture holds under reasonable assumptions (...) |
|
|
|
|
|
|
|
|
|
|
|
Deliberation about what to do in any context requires reasoning about what will or would happen in various alternative situations, including situations that the agent knows will never in fact be realized. In contexts that involve two or more agents who have to take account of each others' deliberation, the counterfactual reasoning may become quite complex. When I deliberate, I have to consider not only what the causal effects would be of alternative choices that I might make, but also what (...) |
|
|
|
|
|
We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f97f49787-zrclg uwo