Completeness of Certain Bimodal Logics for Subset Spaces

Subset Spaces were introduced by L. Moss and R. Parikh in [8]. These spaces model the reasoning about knowledge of changing states.In [2] a kind of subset space called intersection space was considered and the question about the existence of a set of axioms that is complete for the logic of intersection spaces was addressed. In [9] the first author introduced the class of directed spaces and proved that any set of axioms for directed frames also characterizes intersection spaces.We give here a complete axiomatization for directed spaces. We also show that it is not possible to reduce this set of axioms to a finite set.     

S5 knowledge without partitions

We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.     

Spinoza's theory of knowledge

This paper is a discussion of which kinds of knowledge Spinoza himself employs in developing the system of the Ethics. The problem is raised by Professor D. Savan and further discussed by G. H. R. Parkinson. The thesis is (1) that no occurrence of the first kind of knowledge is to be found in the Ethics (against Parkinson), (2) that the main part of the analysis in the Ethics is conducted on the level of the second kind of knowledge (in agreement with Parkinson), and (3) that the third kind of knowledge occurs frequently and plays a most important role in the Ethics (in part against Parkinson). The relation between knowledge and language, the distinction between two types of imagination, or two ways of imagining things, the translation of knowledge of modes of extension into knowledge of the mind, and the relation between the second and third kind of knowledge are main parts of the argument. The third kind of knowledge derives its significance in the Ethics from the definitions and axioms, particularly in Part 1. These definitions and axioms form the basis of the whole system of the Ethics, and at least some of them, it is suggested, belong to the third kind of knowledge.     

The Ryōan-ji axiom for common knowledge on hypergraphs

The article studies common knowledge in communication networks with a fixed topological structure. It introduces a non-trivial principle, called the Ryōan-ji axiom, which captures logical properties of common knowledge of all protocols with a given network topology. A logical system, consisting of the Ryōan-ji axiom and two additional axioms, is proven to be sound and complete.     

Empiricism,probability, and knowledge of arithmetic: A preliminary defense

The topic of this paper is our knowledge of the natural numbers, and in particular, our knowledge of the basic axioms for the natural numbers, namely the Peano axioms. The thesis defended in this paper is that knowledge of these axioms may be gained by recourse to judgments of probability. While considerations of probability have come to the forefront in recent epistemology, it seems safe to say that the thesis defended here is heterodox from the vantage point of traditional philosophy of mathematics. So this paper focuses on providing a preliminary defense of this thesis, in that it focuses on responding to several objections. Some of these objections are from the classical literature, such as Frege's concern about indiscernibility and circularity (Section 2.1), while other are more recent, such as Baker's concern about the unreliability of small samplings in the setting of arithmetic (Section 2.2). Another family of objections suggests that we simply do not have access to probability assignments in the setting of arithmetic, either due to issues related to the ω-rule (Section 3.1) or to the non-computability and non-continuity of probability assignments (Section 3.2). Articulating these objections and the responses to them involves developing some non-trivial results on probability assignments (Appendix A–Appendix C), such as a forcing argument to establish the existence of continuous probability assignments that may be computably approximated (Theorem 4 Appendix B). In the concluding section, two problems for future work are discussed: developing the source of arithmetical confirmation and responding to the probabilistic liar.     

Model Existence in Non-Compact Modal Logic

Predicate modal logics based on Kwith non-compact extra axioms are discussed and a sufficient condition for the model existence theorem is presented. We deal with various axioms in a general way by an algebraic method, instead of discussing concrete non-compact axioms one by one.     

Coherent choice functions under uncertainty

We discuss several features of coherent choice functions—where the admissible options in a decision problem are exactly those that maximize expected utility for some probability/utility pair in fixed set S of probability/utility pairs. In this paper we consider, primarily, normal form decision problems under uncertainty—where only the probability component of S is indeterminate and utility for two privileged outcomes is determinate. Coherent choice distinguishes between each pair of sets of probabilities regardless the “shape” or “connectedness” of the sets of probabilities. We axiomatize the theory of choice functions and show these axioms are necessary for coherence. The axioms are sufficient for coherence using a set of probability/almost-state-independent utility pairs. We give sufficient conditions when a choice function satisfying our axioms is represented by a set of probability/state-independent utility pairs with a common utility.     

Partial monotonicity and a new version of the Ramsey test

We introduce two new belief revision axioms: partial monotonicity and consequence correctness. We show that partial monotonicity is consistent with but independent of the full set of axioms for a Gärdenfors belief revision sytem. In contrast to the Gärdenfors inconsistency results for certain monotonicity principles, we use partial monotonicity to inform a consistent formalization of the Ramsey test within a belief revision system extended by a conditional operator. We take this to be a technical dissolution of the well-known Gärdenfors dilemma.In addition, we present the consequential correctness axiom as a new measure of minimal revision in terms of the deductive core of a proposition whose support we wish to excise. We survey several syntactic and semantic belief revision systems and evaluate them according to both the Gärdenfors axioms and our new axioms. Furthermore, our algebraic characterization of semantic revision systems provides a useful technical device for analysis and comparison, which we illustrate with several new proofs.Finally, we have a new inconsistency result, which is dual to the Gärdenfors inconsistency results. Any elementary belief revision system that is consequentially correct must violate the Gärdenfors axiom of strong boundedness (K^*8), which we characterize as yet another monotonicity condition.This work was supported by the McDonnell Douglas Independent Research and Development program.     

Prior knowledge and exemplar frequency

New concepts can be learned by statistical associations, as well as by relevant existing knowledge. We examined the interaction of these two processes by manipulating exemplar frequency and thematic knowledge and considering their interaction through computational modeling. Exemplar frequency affects category learning, with high-frequency items learned more quickly than low-frequency items, and prior knowledge usually speeds category learning. In two experiments in which both of these factors were manipulated, we found that the effects of frequency are greatly reduced when stimulus features are linked by thematic prior knowledge and that frequency effects on single stimulus features can actually be reversed by knowledge. We account for these results with the knowledge resonance model of category learning (Rehder & Murphy, 2003) and conclude that prior knowledge may change representations so that empirical effects, such as those caused by frequency manipulations, are modulated.     

Inexact Knowledge with Introspection

Standard Kripke models are inadequate to model situations of inexact knowledge with introspection, since positive and negative introspection force the relation of epistemic indiscernibility to be transitive and euclidean. Correlatively, Williamson’s margin for error semantics for inexact knowledge invalidates axioms 4 and 5. We present a new semantics for modal logic which is shown to be complete for K45, without constraining the accessibility relation to be transitive or euclidean. The semantics corresponds to a system of modular knowledge, in which iterated modalities and simple modalities are not on a par. We show how the semantics helps to solve Williamson’s luminosity paradox, and argue that it corresponds to an integrated model of perceptual and introspective knowledge that is psychologically more plausible than the one defended by Williamson. We formulate a generalized version of the semantics, called token semantics, in which modalities are iteration-sensitive up to degree n and insensitive beyond n. The multi-agent version of the semantics yields a resource-sensitive logic with implications for the representation of common knowledge in situations of bounded rationality.     

Relativized common knowledge for dynamic epistemic logic

Relativized common knowledge is a generalization of common knowledge proposed for public announcement logic by treating knowledge update as relativization. Among other things relativized common knowledge, unlike standard common knowledge, allows reduction axioms for the public announcement operators. Public announcement logic can be seen as one of the simplest special cases of action model logic (AML). However, so far no notion of relativized common knowledge has been proposed for AML in general. That is what we do in this paper. We propose a notion of action model relativized common knowledge for action model logic, and study expressive power and complete axiomatizations of resulting logics. Along the way we fill some gaps in existing expressivity results for standard relativized common knowledge.     

What is Classical Mereology?

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two “neutral” axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of “strong complement” that helps explicate the connections between the theories.     

Learning the Natural Numbers as a Child

How do we get out knowledge of the natural numbers? Various philosophical accounts exist, but there has been comparatively little attention to psychological data on how the learning process actually takes place. I work through the psychological literature on number acquisition with the aim of characterising the acquisition stages in formal terms. In doing so, I argue that we need a combination of current neologicist accounts and accounts such as that of Parsons. In particular, I argue that we learn the initial segment of the natural numbers on the basis of the Fregean definitions, but do not learn the natural number structure as a whole on the basis of Hume's principle. Therefore, we need to account for some of the consistency of our number concepts with the Dedekind‐Peano axioms in other terms.     

Communication in collaborative discovery learning

Background. Constructivist approaches to learning focus on learning environments in which students have the opportunity to construct knowledge themselves, and negotiate this knowledge with others. Discovery learning and collaborative learning are examples of learning contexts that cater for knowledge construction processes. We introduce a computer‐based learning environment in which the two forms of learning are implemented simultaneously. We focus on the interaction between discovery learning and collaborative learning. Aim. We aim to investigate which communicative activities are frequently used in the discovery learning process and which communicative and discovery activities co‐occur. Sample. The study involved 21 pairs of 10th‐grade students enrolled in pre‐university education, ranging from 15 to 17 years of age. Method. Participants worked in dyads on separate screens in a shared discovery learning environment. They communicated using a chat box. In order to find a possible relationship between communicative activities and discovery learning processes, correlational analysis and principal component analysis were performed. Result. Significant relationships were found between communicative and discovery activities, as well as five factors combining the communicative process and the discovery learning processes. Communicative activities are performed most frequently during the activities in generating hypotheses, experimental design, and conclusion construction. Argumentation occurs less than expected, and is associated with the construction of conclusions, rather than generating hypotheses. Conclusion. Communicative activities co‐occur with discovery activities most of the time, as we expected. Further research should concentrate on means to augment communicative and discovery activities that are related to positive learning outcomes.     

A method of weighing qualitative preference axioms

A method is developed for determining the absolute and relative strengths of qualitative preference axioms in normative Bayesian decision theory. These strengths are calculated for the three most common qualitative axioms; transitivity, the sure-thing principle, and dominance. The relative strength of the latter two axioms with respect to transitivity is calculated for special cases, and a bound is derived which is applicable to a larger class of decision problems. Possible implications of this theoretical work for decision heuristics are discussed.     

数学真理的问题

在当前数学实践中,数学知识（如果有这样的知识的话）是通过在定义和公理的基础上证明定理来获得的。问题在于该怎样理解证明中所得到的东西是如何构成知识的,具体而言,即是要给出一个关于数学真理和数学知识的统一的解释,该解释能够揭示两者的内在联系。此处的困难是,根据贝纳塞拉夫的为人熟知的论证,由于塔斯基语义学认为真与对象的联系（通过单称词项或通过量词）是不可消去的,因此在数学中无法将塔斯基语义学与完整的认识论相结合：数学知识要么是通过证明得到的,这种情况下数学知识与数学对象是无关的,因此我们就无法解释数学真理;要么数学对象是数学真理的构件,从而数学知识不是通过证明得到的,这种情况下我们就无从理解数学知识。接着,本文通过一系列阶段,将这些困难一直追溯到最基本的逻辑观念,即将之看作形式的和纯粹解释性的：如果数学是从概念出发仅仅使用逻辑的推理实践,依照康德,那么数学应该是分析的,也即,仅仅是解释性的,根本就不是通常意义上的知识。我认为,这对数学真理是真正困难的问题。本文概括了四种回应,其中仅有一个有希望解决我们的困难,也即皮尔斯和弗雷格的回应。根据他们的方案,逻辑是科学,因此是实验性的和可错的;符号语言是有内容的,尽管并不涉及与任何对象的关联;证明是构成性的,因此是富于产出的过程。通过充分发展这些观点,我们将有可能最终解决数学真理的问题。     

Notes on Mally’s deontic logic and the collapse of {\varvec{Seinsollen}} and {\varvec{Sein}}

This paper analyzes Mally’s system of deontic logic, introduced in his The Basic Laws of Ought: Elements of the Logic of Willing (1926). We discuss Mally’s text against the background of some contributions in the literature which show that Mally’s axiomatic system for deontic logic is flawed, in so far as it derives, for an arbitrary A, the theorem “A ought to be the case if and only if A is the case”, which represents a collapse of obligation. We then try to sort out and understand which axioms are responsible for the collapse and consider two ways of amending Mally’s system: (i) by changing its original underlying logical basis, that is classical logic, and (ii) by modifying Mally’s axioms.     

Nonparametric item response theory axioms and properties under nonlinearity and their exemplification with knowledge space theory

This paper investigates the dichotomous Mokken nonparametric item response theory (IRT) axioms and properties under incomparabilities among latent trait values and items. Generalized equivalents of the unidimensional nonparametric IRT axioms and properties are formulated for nonlinear (quasi-ordered) person and indicator spaces. It is shown that monotone likelihood ratio (MLR) for the total score variable and nonlinear latent trait implies stochastic ordering (SO) of the total score variable, but may fail to imply SO of the nonlinear latent trait. The reason for this and conditions under which the implication holds are specified, based on a new, simpler proof of the fact that in the unidimensional case MLR implies SO. The approach is applied in knowledge space theory (KST), a combinatorial test theory. This leads to a (tentative) Mokken-type nonparametric axiomatization in the currently parametric theory of knowledge spaces. The nonparametric axiomatization is compared with the assumptions of the parametric basic local independence model which is fundamental in KST. It is concluded that this paper may provide a first step toward a basis for a possible fusion of the two split directions of psychological test theories IRT and KST.     

Implicit learning: Indirect, not unconscious

Dienes and Berry (1997) argue that there really are two kinds of knowledge, implicit and explicit, that can be characterized through a subjective threshold. We argue that the subjective threshold does not separate two forms of knowledge, but instead two uses of knowledge, for two different purposes. With Neal and Hesketh (1997), we suggest that an understanding of learning will be better served by investigating the processing that occurs under various circumstances than by attempting to isolate learning that occurs with awareness from that which occurs without it.     

Long-term symbolic learning

What are the characteristics of long-term learning? We investigated the characteristics of long-term, symbolic learning using the Soar and ACT-R cognitive architectures running cognitive models of two simple tasks. Long sequences of problems were run collecting data to answer fundamental questions about long-term, symbolic learning. We examined whether symbolic learning continues indefinitely, how the learned knowledge is used, and whether computational performance degrades over the long term. We report three findings. First, in both systems, symbolic learning eventually stopped. Second, learned knowledge was used differently in different stages but the resulting production knowledge was used uniformly. Finally, both Soar and ACT-R do eventually suffer from degraded computational performance with long-term continuous learning. We also discuss ACT-R implementation and theoretic causes of ACT-R’s computational performance problems and settings that appear to avoid the performance problems in ACT-R.