Epistemic Logic

In this paper, we continued the preparatory works of Jingde Cheng in conjunction with spatio-temporal relevant logics, and proposed several epistemic spatio-temporal relevant logics as basic logics for Mobile Multi-Agent Systems (MMAS). To establish an inference system, important elements are: semantics and syntax appropriate to it include a language, axioms and inference rules. By proving the meta-logical properties such as soundness and consistency, completeness and decidability and etc., we have a method to test the reliability of the systems. Finally, we (...) will have models and algorithms for the application of these logics in the MMAS. (shrink)

Williamson (2000) argues that the KK principle is inconsistent with knowledge of margin for error in cases of inexact perceptual observations. This paper argues, primarily by analogy to a different scenario, that Williamson’s argument is fallacious. Margin for error principles describe the agent’s knowledge as a result of an inexact perceptual event, not the agent’s knowledge state in general. Therefore, epistemic agents can use their knowledge of margin for error at most once after a perceptual event, but not more. This (...) insight blocks a crucial step in Williamson’s original argument. Along the way, the value of standard epistemic logic for analyzing margin for error reasoning is challenged. (shrink)

We give a theory of epistemic modals in the framework of possibility semantics and axiomatize the corresponding logic, arguing that it aptly characterizes the ways in which reasoning with epistemic modals does, and does not, diverge from classical modal logic.

W tym artykule zaproponuję konstrukcję trójwartościowej logiki przekonań, którą nazywam: LSB3_1. Podam również i udowodnię kompletność LSB3_1 w odniesieniu do danej semantyki. LSB3_1 opiera się na preformalnych założeniach i intuicjach, które przedstawiono w sekcji 1. Sekcja 2 zawiera składnię i podział instrukcji LSB3_1 na wewnętrzne i zewnętrzne. Rozdział 3 przedstawia semantykę LSB3_1, a także szereg tautologii i formuł nietautologicznych w LSB3_1 wraz z ich intuicyjną interpretacją. System aksjomatyczny dla LSB3_1 i jego porównanie z silną logiką Kleene'a są przedstawione w sekcji (...) 4. Twierdzenie o kompletności dla LSB3_1 jest przedstawione w rozdziale 5. Zdefiniuję termin koniunkcyjna forma normalna i przedstawię lematy, które prowadzą do udowodnienia redukcji języka LSB3_1 wzory przed udowodnieniem twierdzenia o zupełności. (shrink)

This paper discusses the theoretical assumptions behind the conception of the logic of faith and deed and outlines its formal-axiomatic frame and its method of construction, which enable us to understand it as a kind of deductive science. The paper is divided into several sections, starting with the logical analysis of the ambiguous terms of ‚faith’ and ‚action’, and focusing in particular on the concepts of religious faith and deed as a type of conscious activity relating to a matter or (...) matters of social importance. After outlining the main ideas and basic assumptions of the theoretical conception of the LF&D as an axiomatic theory, the author introduces some axiom systems for: 1) the logics of faith LF, 2) the logic of deed LD, and 3) certain logics of norms DL connected with „duties” and concerning actions/deeds. Lastly, the paper outlines the scientific LF&D based on the three types of logic 1)–3). (shrink)

KK states that knowing entails knowing that one knows and K~K states that not knowing entails knowing that one does not know. In light of the arguments against KK and K~K, one might consider modally qualified variants of those principles. According to WEAK KK, knowing entails the possibility of knowing that one knows. And according to WEAK K~K, not knowing entails the possibility of knowing that one does not know. This paper shows that WEAK KK and WEAK K~K are much (...) stronger than they initially appear. Jointly, they entail KK and K~K. And they are susceptible to variants of the standard arguments against KK and K~K. This has interesting implications for the debate on positive introspection and for deeper issues concerning the structure and limits of knowability. (shrink)

The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic |$\textbf {PTEL}$| is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend |$\textbf {PTEL}$| to axiomatize the corresponding first-order logic.

Tomis Kapitan’s work on Peirce’s conception of abduction was instrumental for our coming to see how Peircean abduction both relates to and is importantly different from inference to the best explanation (IBE). However, he ultimately concluded that Peirce’s conception of abduction was a muddle. Despite the deeply problematic nature of Peirce’s theory of abduction in these respects, Kapitan’s work on Peircean abduction offers insight into the nature of abductive inquiry that is importantly relevant to the task of making sense of (...) explanatory inquiry in the sciences in general. The view developed here stems from his work and involves disambiguating three forms of inference involved in Peircean abduction in terms of Reichenbach’s and Laudan’s context models of inquiry. Importantly, this includes understanding that abduction involves the context of pursuit. (shrink)

It is natural to suppose the following three: factivity of knowledge, alda-know synonymy, and the univocity of alda. However, rago-knowledge attribution, expressed by “rago alda” sentences, seems to defeat to hold them at once. In this paper, I try to dissolve this predicament, analyzing “rago alda” sentence as a kind of hybrid language expression. And the theoretical advantages, which my analysis has over other possible, alternative approaches, are to be shown.

Belief revision theories standardly endorse a principle of intensionality to the effect that ideal doxastic agents do not discriminate between pieces of information that are equivalent within classical logic. I argue that this principle should be rejected. Its failure, on my view, does not require failures of logical omniscience on the part of the agent, but results from a view of the update as _mighty_: as encoding what the agent learns might be the case, as well as what must be. (...) The view is motivated by consideration of a puzzle case, obtained by transposing into the context of belief revision a kind of scenario that Kit Fine has used to argue against intensionalism about counterfactuals. Employing the framework of truthmaker semantics, I go on to develop a novel account of belief revision, based on a conception of the update as mighty, which validates natural hyperintensional counterparts of the usual AGM postulates. (shrink)

This paper will develop ideas from [44]. We will generalize their work in two directions. First, we provide axioms for justification logics over the base logic B and show that the logic permits a proof of the internalization theorem. Second, we provide alternative frames that more closely resemble the standard versions of the ternary relational frames, as well as a more general approach to the completeness proof. We prove that soundness and completeness hold for justification logics over a wide variety (...) of base logics. Finally, we will strengthen Belnap’s variable sharing for the justification logic context, demonstrating that the justifications are properly relevant justifications. (shrink)

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for extensions with combinations of seriality axioms and what we call "intuitionistic path axioms". We show that each axiomatization is sound and complete with completeness being shown via a typical canonical model construction.

According to Plato’s Apology of Socrates, a humanly wise person is distinguished by her ability to correctly assess the epistemic status and value of her beliefs. She knows when she has knowledge or has mere belief or is ignorant. She makes no unjustified knowledge claims and considers her knowledge to be limited in scope and value. This means: A humanly wise person is intellectually modest. However, when interpreted classically, Socratic wisdom cannot be modest. For in classical epistemic logic, modelling second-order (...) knowledge of knowing something or not, i.e. positive and negative introspection, requires a degree of self-transparency that would at most be attributed to an omniscient and infallible agent. If intellectual modesty is part of Socratic wisdom, we have to look for another epistemic model. I will offer three proposals and argue that an intuitionist reading of the classical concept of knowledge is best suited for this purpose. (shrink)

In this paper I will compare two competing accounts of assertion: the knowledge account and the justified belief account. When it comes to the evidence that is typically used to assess accounts of assertion – including the evidence from lottery propositions, the evidence from Moore’s paradoxical propositions and the evidence from conversational patterns – I will argue that the justified belief account has at least as much explanatory power as its rival. I will argue, finally, that a close look at (...) the ways in which assertions can be challenged and retracted reveals a certain advantage for the justified belief account. The paper will touch upon a number of further topics along the way, including the logical interaction between knowledge and justified belief, the nature of defeat, and the hypothesis that knowledge and justified belief are normatively coincident goals. (shrink)

We offer a general framework for theorizing about the structure of knowledge and belief in terms of the comparative normality of situations compatible with one's evidence. The guiding idea is that, if a possibility is sufficiently less normal than one's actual situation, then one can know that that possibility does not obtain. This explains how people can have inductive knowledge that goes beyond what is strictly entailed by their evidence. We motivate the framework by showing how it illuminates knowledge about (...) the future, knowledge of lawful regularities, knowledge about parameters measured using imperfect instruments, the connection between knowledge, belief, and probability, and the dynamics of knowledge and belief in response to new evidence. (shrink)

I propose a novel hyperintensional semantics for belief revision and a corresponding system of dynamic doxastic logic. The main goal of the framework is to reduce some of the idealisations that are common in the belief revision literature and in dynamic epistemic logic. The models of the new framework are primarily based on potentially incomplete or inconsistent collections of information, represented by situations in a situation space. I propose that by shifting the representational focus of doxastic models from belief sets (...) to collections of information, and by defining changes of beliefs as artifacts of changes of information, we can achieve a more realistic account of belief representation and belief change. The proposed dynamic operation suggests a non-classical way of changing beliefs: belief revision occurs in non-explosive environments which allow for a non-monotonic and hyperintensional belief dynamics. A logic that is sound with respect to the semantics is also provided. (shrink)

This paper explores the principle that knowledge is fragile, in that whenever S knows that S doesn’t know that S knows that p, S thereby fails to know p. Fragility is motivated by the infelicity of dubious assertions, utterances which assert p while acknowledging higher-order ignorance whether p. Fragility is interestingly weaker than KK, the principle that if S knows p, then S knows that S knows p. Existing theories of knowledge which deny KK by accepting a Margin for Error (...) principle can be conservatively extended with Fragility. (shrink)

One of the most intriguing claims in Sven Rosenkranz’s Justification as Ignorance is that Timothy Williamson’s celebrated anti-luminosity argument can be resisted when it comes to the condition ~K~KP—the condition that one is in no position to know that one is in no position to know P. In this paper, I critically assess this claim.

The aim of this paper is to explore the advantages deriving from the application of relating semantics in epistemic logic. As a first step, I will discuss two versions of relating semantics and how they can be differently exploited for studying modal and epistemic operators. Next, I consider several standard frameworks which are suitable for modelling knowledge and related notions, in both their implicit and their explicit form and present a simple strategy by virtue of which they can be associated (...) with intuitive systems of relating logic. As a final step, I will focus on the logic of knowledge based on justification logic and show how relating semantics helps us to provide an elegant solution to some problems related to the standard interpretation of the explicit epistemic operators. (shrink)

We propose a logic to reason about data collected by a num- ber of measurement systems. The semantic of this logic is grounded on the epistemic theory of measurement that gives a central role to measure- ment devices and calibration. In this perspective, the lack of evidences (in the available data) for the truth or falsehood of a proposition requires the introduction of a third truth-value (the undetermined). Moreover, the data collected by a given source are here represented by means (...) of a possible world, which provide a contextual view on the objects in the domain. We approach (possibly) conflicting data coming from different sources in a social choice theoretic fashion: we investigate viable opera- tors to aggregate data and we represent them in our logic by means of suitable (minimal) modal operators. (shrink)

In order to reply to the contemporary skeptic’s argument for the conclusion that we don’t have any empirical knowledge about the external world, several authors have proposed different fallibilist theories of knowledge that reject the epistemic closure principle. Holliday, 1–62 2015a), however, shows that almost all of them suffer from either the problem of containment or the problem of vacuous knowledge or both. Furthermore, Holliday suggests that the fallibilist should allow a proposition to have multiple sets of relevant alternatives, each (...) of which is sufficient while none is necessary, if all its members are eliminated, for knowing that proposition. Not completely satisfied with Holliday’s multi-path reply to the skeptic, the author suggests a new single-path relevant-possibility theory of knowledge and argues that it can avoid both the problem of containment and the problem of vacuous knowledge of a certain sort while rejecting skepticism about the external world. (shrink)

We strengthen the foundations of epistemic logic by formalizing the family of normal modal logics in the proof assistant Isabelle/HOL. We define an abstract canonical model and prove a truth lemma for any logic in the family. We then instantiate it with logics based on various epistemic principles to obtain completeness results for systems from K to S5. Our work gives a disciplined treatment of completeness-via-canonicity arguments and demonstrates their compositionality.

We propose a logic of knowledge for impure simplicial complexes. Impure simplicial complexes represent distributed systems under uncertainty over which processes are still active and which processes have failed or crashed. Our work generalizes the logic of knowledge for pure simplicial complexes, where all processes are alive, by Goubault et al. Our logical semantics has a satisfaction relation defined simultaneously with a definability relation. The latter restricts which formulas are allowed to have a truth value: dead processes cannot know or (...) be uncertain about any proposition, and live processes cannot know or be uncertain about propositions involving processes they know to be dead. The logic satisfies some but not all axioms and rules of the modal logic S5. Impure simplicial complexes correspond to Kripke models where each agent’s accessibility relation is an equivalence relation on a subset of the domain only. We also propose a notion of bisimulation for impure simplicial complexes and show bisimulation correspondence. (shrink)

Artemov and Protopopescu introduced a Brouwer-Heyting-Kolmogorov interpretation of knowledge operator to define the intuitionistic epistemic logic IEL, where the axiom A⊃KA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\supset KA$$\end{document} is accepted but the axiom KA⊃A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$KA\supset A$$\end{document} is refused. This paper studies the notion of distributed knowledge on an expansion of the multi agent variant of IEL. We provide a BHK interpretation of distributed knowledge operator to define the intuitionistic epistemic (...) logic with distributed knowledge DIEL. We construct Hilbert system and cut-free sequent calculus for DIEL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {DIEL}$$\end{document} and show that they are sound and complete for the intended Kripke semantics. (shrink)

Rosenkranz devised two bimodal epistemic logics: an idealized one and a realistic one. The former is shown to be sound with respect to a class of neighborhood frames called i-frames. Rosenkranz designed a specific i-frame able to invalidate a series of undesired formulas, proving that these are not theorems of the idealized logic. Nonetheless, an unwanted formula and an unwanted rule of inference are not invalidated. Invalidating the former guarantees the distinction between the two modal operators characteristic of the logic, (...) while invalidating the latter is crucial in order to deal with the problem of logical omniscience. In this paper, I present an i-frame able to invalidate all the undesired formulas already invalidated by Rosenkranz, together with the missing formula and rule of inference. (shrink)

The field of epistemic logic developed into an interdisciplinary area focused on explicating epistemic issues in, for example, artificial intelligence, computer security, game theory, economics, multiagent systems and the social sciences. Inspired, in part, by issues in these different ‘application’ areas, in this paper I propose an epistemic logic T for metadata extracted from scientific papers on COVID-19. More in details, I introduce a structure S to syntactically and semantically modelling metadata extracted with systems for extracting structured metadata from scientific (...) articles in a born-digital form. These systems will be considered, in the logical model created, as ‘Metadata extraction agents’. In this case MEA taken into consideration are CERMINE and TeamBeam. In an increasingly data-driven world, modelling data or metadata means to help systematise existing information and support the research community in building solutions to the COVID-19 pandemic. (shrink)

There are several features of law which rightly draw the interest of philosophers, especially those whose expertise lies in ethics and social and political philosophy. But the law also has features which haven’t stirred much in the way of philosophical investigation. I must say that I find this surprising. For the fact is that a well-run criminal trial is a master-class in logic and epistemology. Below I examine the logical and epistemological properties of greatest operational involvement in a criminal proceedings, (...) concepts such as evidence, proof, argument, inference, relevance, probability, and more. My principal objective is to expose the deep cleavage between establishment norms in epistemology and logic and standard practice in criminal proceedings. This gives us two options to reflect upon. In one, the establishment norms for the correct management of the concepts in question are basically sound. In that case, as I will show, common law criminal practice would be basically unsound; its convictions would be basically false and unjust. Seen from the other perspective, the criminal justice system would be basically sound, and its criminal convictions basically true and just. It turns out to matter that option one meets with widely spread common disbelief and is generally taken as contrary to common knowledge. What is needed here is an epistemology which gives these sentiments some air to breathe. I will argue that on balance it is the logico-epistemic establishment which requires some serious rethinking. (shrink)

Dynamic Epistemic Logic is the logic of knowledge change. This book provides various logics to support such formal specifications, including proof systems. Concrete examples and epistemic puzzles enliven the exposition. The book also offers exercises with answers. It is suitable for graduate courses in logic. Many examples, exercises, and thorough completeness proofs and expressivity results are included. A companion web page offers slides for lecturers and exams for further practice.

Is knowledge definable as justified true belief? We argue that one can legitimately answer positively or negatively, depending on whether or not one’s true belief is justified by what we call adequate reasons. To facilitate our argument we introduce a simple propositional logic of reason-based belief, and give an axiomatic characterization of the notion of adequacy for reasons. We show that this logic is sufficiently flexible to accommodate various useful features, including quantification over reasons. We use our framework to contrast (...) two notions of JTB: one internalist, the other externalist. We argue that Gettier cases essentially challenge the internalist notion but not the externalist one. Our approach commits us to a form of infallibilism about knowledge, but it also leaves us with a puzzle, namely whether knowledge involves the possession of only adequate reasons, or leaves room for some inadequate reasons. We favor the latter position, which reflects a milder and more realistic version of infallibilism. (shrink)

In this article, I propose a formal criterion that distinguishes between deductively valid arguments that do and do not beg the question. I define the concept of a Never-failing Minimally Competent Knower (NMCK) and suggest that an argument begs the question just in case it cannot possibly assist an NMCK in extending his or her knowledge.

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)

In this article we develop a logical model for automatic extraction of structured metadata. We introduce a new predicate???? – reads ‘extract’ – and a structure???? to syntactically and semantically define metadata extracted with any automatic metadata extraction system. These systems will be considered, in the logical model created, as knowledge extraction agents. In this case KEA taken into consideration is CERMINE, a comprehensive open-source system for extracting structured metadata from scientific articles in a born-digital form.

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate (...) the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic in the context of relational structures with two sorts, one for worlds and one for information states, and characterise inquisitive modal logic as the bisimulation invariant fragment of first-order logic over various natural classes of two-sorted structures. (shrink)

There is a very plausible principle linking abilities and possibilities: If S is able to Φ, then it is metaphysically possible that S Φ’s. Jack Spencer recently proposed a class of counterexamples to this principle involving the ability to know certain propositions. I renew an argument against these counterexamples based on the unknowability of Fitch propositions. In doing so, I provide a new argument for the unknowability of Fitch propositions and show that Spencer’s counterexamples are in tension with a principle (...) weaker than the one linking abilities and possibilities. (shrink)

We present a framework for epistemic logic, modeling the logical aspects of System 1 and System 2 cognitive processes, as per dual process theories of reasoning. The framework combines non-normal worlds semantics with the techniques of Dynamic Epistemic Logic. It models non-logically-omniscient, but moderately rational agents: their System 1 makes fast sense of incoming information by integrating it on the basis of their background knowledge and beliefs. Their System 2 allows them to slowly, step-wise unpack some of the logical consequences (...) of such knowledge and beliefs, by paying a cognitive cost. The framework is applied to three instances of limited rationality, widely discussed in cognitive psychology: Stereotypical Thinking, the Framing Effect, and the Anchoring Effect. (shrink)

As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of these (...) logics. (shrink)

Marton ( 2019 ) argues that that it follows from the standard antirealist theory of truth, which states that truth and possible knowledge are equivalent, that knowing possibilities is equivalent to the possibility of knowing, whereas these notions should be distinct. Moreover, he argues that the usual strategies of dealing with the Church–Fitch paradox of knowability are either not able to deal with his modal-epistemic collapse result or they only do so at a high price. Against this, I argue that (...) Marton’s paper does not present any seriously novel challenge to anti-realism not already found in the Church–Fitch result. Furthermore, Edgington ( 1985 ) reformulated antirealist theory of truth can deal with his modal-epistemic collapse argument at no cost. (shrink)

In this article, we present a new approach of modelling epistemic uncertainties in degradation processes. This approach is established in the framework of finite degradation structures, whic...

The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by the idea of an auxiliary semantics studied by van Benthem and Wang et al. A key insight of our auxiliary semantics for dynamic logic of relation changers can be described as: “relation changers are bounded morphisms.” Moreover, we demonstrate that this semantic insight can be used to provide a modular cut-free labelled (...) sequent calculus for the logic in the sense that our calculus can be regarded as a natural expansion of a labelled sequent calculus of iteration-free propositional dynamic logic. (shrink)

The principle of epistemic closure is the claim that what is known to follow from knowledge is known to be true. This intuitively plausible idea is endorsed by a vast majority of knowledge theorists. There are significant problems, however, that have to be addressed if epistemic closure – closed knowledge – is endorsed. The present essay locates the problem for closed knowledge in the separation it imposes between knowledge and evidence. Although it might appear that all that stands between knowing (...) the truth of the premises of a valid inference and knowledge of its conclusion is inferring it from the premises, the evidence for each of the premises may jointly count against the conclusion. The intuitive view regarding inferred knowledge says one thing, the evidence says another. One epistemological framework that seems to have the resources to resolve this tension endorses the view that knowledge always requires conclusive evidence. A second framework resolves the tension by limiting the scope of the closure principle. Only inferences drawn directly from propositions contained in the scope of a single knowledge operator are considered closed. The aim of the present essay is to revive the unpopular third option, the idea that knowledge is open. The essay proceeds by arguing that in different ways the two former frameworks only succeed in relocating the problem, not in resolving it. The first framework, the infallibilist view, relocates the problem to a sharp separation between knowledge of the occurrences of events from knowledge of their chance of occurring, a separation leading to several significant additional problems. The fallibilist view, the second framework, in endorsing closure neglects to take into full account the ways in which evidence fails to be transitive. For instance, evidence can count in favor of a conjunction while counting against each of its conjuncts. This fact, which is argued for in the essay on probabilistic as well as non-probabilistic grounds, is used as the foundation of an argument against closed knowledge that can be used as a way to understand several of the most fundamental challenges of epistemology. Not only can an open knowledge view that is based on open evidence resolve all these problems in a simple and natural way, it can also respond to formidable challenges that significantly hinder other open knowledge views. There are good reasons, then, to view both knowledge and evidence as open. (shrink)

The paper aims at outlining the conceptual frame in which nineteenth-century German philosophy inherits and pursues the British debate on induction. It investigates this debate as a case study for a broader inquiry about the German reception of late British empiricism. The Mill-Whewell controversy on induction is central to the late British empiricism´s project of a logic of natural sciences. It becomes significant in Germany during the second half of the nineteenth century, as a means of defining a theory of (...) science that supports the rising anti-idealist endeavor. The paper first defines what is at stake in the Mill-Whewell controversy, then considers how the same issue is handled in Apelt´s Die Theorie der Induction (1854) and in Sigwart´s Logik (1873-1878). It concludes that, within the German context, the understanding of this issue cannot be disconnected from a Kantian focus on the transcendental foundation of scientific knowledge, and that this characteristic perspective on induction also implies some innovative developments for induction as a scientific method, mainly concerning the relevance and use of probability and statistics in inductive methods. (shrink)

When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\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}” and propose a Kripke-style semantics of such expressions in terms of knowing an explanation 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}. We obtain two sound and complete axiomatizations w.r.t. two different model classes depending on different assumptions about introspection. Finally we connect our logic with justification logic technically by providing an alternative semantics and an in-depth comparison on various design choices. (shrink)

Like belief revision, conceptual change has rational aspects. The paper discusses this for predicate change. We determine the meaning of predicates by a set of imaginable instances, i.e., conceptually consistent entities that fall under the predicate. Predicate change is then an alteration of which possible entities are instances of a concept. The recent exclusion of Pluto from the category of planets is an example of such a predicate change. In order to discuss predicate change, we define a monadic predicate logic (...) with three different kinds of lawful belief: analytic laws, which hold for all possible instances; doxastic laws, which hold for the most plausible instances; and typicality laws, which hold for typical instances. We introduce predicate changing operations that alter the analytic laws of the language and show that the expressive power is not affected by the predicate change. One can translate the new laws into old laws and vice versa. Moreover, we discuss rational restrictions of predicate change. These limit its possible influence on doxastic and typicality laws. Based on the results, we argue that predicate change can be quite conservative and sometimes even hardly recognisable. (shrink)

We propose that, for the purpose of studying theoretical properties of the knowledge of an agent with Artificial General Intelligence (that is, the knowledge of an AGI), a pragmatic way to define such an agent’s knowledge (restricted to the language of Epistemic Arithmetic, or EA) is as follows. We declare an AGI to know an EA-statement φ if and only if that AGI would include φ in the resulting enumeration if that AGI were commanded: “Enumerate all the EA-sentences which you (...) know.” This definition is non-circular because an AGI, being capable of practical English communication, is capable of understanding the everyday English word “know” independently of how any philosopher formally defines knowledge; we elaborate further on the non-circularity of this circular-looking definition. This elegantly solves the problem that different AGIs may have different internal knowledge definitions and yet we want to study knowledge of AGIs in general, without having to study different AGIs separately just because they have separate internal knowledge definitions. Finally, we suggest how this definition of AGI knowledge can be used as a bridge which could allow the AGI research community to import certain abstract results about mechanical knowing agents from mathematical logic. (shrink)