A conjunction in closure spaces

This paper is closely related to investigations of abstract properties of basic logical notions expressible in terms of closure spaces as they were begun by A. Tarski (see [6]). We shall prove many properties of ω-conjunctive closure spaces (X is ω-conjunctive provided that for every two elements of X their conjunction in X exists). For example we prove the following theorems:

1. For every closed and proper subset of an ω-conjunctive closure space its interior is empty (i.e. it is a boundary set).
2. If X is an ω-conjunctive closure space which satisfies the ω-compactness theorem and \(\hat P\) [X] is a meet-distributive semilattice (see [3]), then the lattice of all closed subsets in X is a Heyting lattice.
3. A closure space is linear iff it is an ω-conjunctive and topological space.
4. Every continuous function preserves all conjunctions.

     

On Extracting Variable Herbrand Disjunctions

Studia Logica - Some quantitative results obtained by proof mining take the form of Herbrand disjunctions that may depend on additional parameters. We attempt to elucidate this fact through an...     

Conjunctions,Disjunctions and Lewisian Semantics for Counterfactuals

Consider the reasonable axioms of subjunctive conditionals (1) if p q ₁ and p q ₂ at some world, then p (q ₁ & q ₂) at that world, and (2) if p ₁ q and p ₂ q at some world, then (p ₁ ∨ p ₂) q at that world, where p q is the subjunctive conditional. I show that a Lewis-style semantics for subjunctive conditionals satisfies these axioms if and only if one makes a certain technical assumption about the closeness relation, an assumption that is probably false. I will then show how Lewisian semantics can be modified so as to assure (1) and (2) even when the technical assumption fails, and in fact in one sense the semantics actually becomes simpler then.     

Towards closure on closure

Tracking theories of knowledge are widely known to have the consequence that knowledge is not closed. Recent arguments by Vogel and Hawthorne claim both that there are no legitimate examples of knowledge without closure and that the costs of theories that deny closure are too great. This paper considers the tracking theories of Dretske and Nozick and the arguments by Vogel and Hawthorne. We reject the arguments of Vogel and Hawthorne and evaluate the costs of closure denial for tracking theories of knowledge.     

对相容和不相容析取关系下析取句与条件句之间推理的比较

研究析取句和条件句之间的推理能检验推理心理学中的主要理论解释。一个实验考察了析取句和条件句中两个基本成分之间的关系(相容析取与不相容析取)和推理方向(由析取句推条件句与由条件句推析取句)对析取句与其等值的条件句之间推理的影响。结果发现,推理方向的影响取决于条件句和析取句中基本成分间的关系,在不相容析取关系下的推理成绩好于在相容析取关系下的推理成绩。现有的推理理论不能解释被试的整体反应模式,作者提出的特殊知识启发式与一般的句法意义对比启发式的竞争能统一解释被试的主导反应模式。     

Getting a little closure for closure

Synthese - In this paper, I’ll survey a number of closure principles of epistemic justification and find them all wanting. However, it’ll be my contention that there’s a novel...     

Deductive closure

This is a brief review of issues over which Henry Kyburg and I differed concerning the requirement that full beliefs should be closed under deductive consequence.     

Semantic closure

This paper argues for tlie claims that a) a natural language such as English is semanticaly closed b) semantic closure implies inconsistency. A corollary of these is that the semantics of English must be paraconsistent. The first part of the paper formulates a definition of semantic closure which applies to natural languages and shows that this implies inconsistency. The second section argues that English is semeantically closed. The preceding discussion is predicated on the assumption that there are no truth value gaps. The next section of the paper considers whether the possibility of these makes any difference to the substantive conclusions of the previous sections, and argues that it does not. The crux of the preceding arguments is that none of the consistent semantical accounts that have been offered for solving the semantical paradoxes is a semantic ofEnglish. The final section of the paper produces a general argument as to why this must always be the case.     

Semantics in Banach spaces

A new approach to semantics, based on ordered Banach spaces, is proposed. The Banach spaces semantics arises as a generalization of the four particular cases: the Giles' approach to belief structures, its generalization to the non-Boolean case, and “fuzzy extensions” of Boolean as well as of non-Boolean semantics.     

Narrative closure

In this article, “Narrative Closure,” a theory of the nature of narrative closure is developed. Narrative closure is identified as the phenomenological feeling of finality that is generated when all the questions saliently posed by the narrative are answered. The article also includes a discussion of the intelligibility of attributing questions to narratives as well as a discussion of the mechanisms that achieve this. The article concludes by addressing certain recent criticisms of the view of narrative expounded by this article.     

Cellular spaces

This paper is an introduction into the theory of cellular spaces. From the more general model of nets of abstract cells which are interpreted by finite automata, it is shown how the model of cellular spaces is achieved by specialization. Cellular spaces are extremely homogeneous in function and in geometry. The relation between local and global behavior is regarded as the main topic of the theory. After a formal definition of cellular spaces, it is shown that not all functions of the configuration space are induced by cellular spaces. In addition, the Garden-of-Eden problem is discussed, and a simple self-reproduction property is explained.     

Psychodiagnosis in hypothetical problem spaces

Computer uses are demonstrated for designing a hypothetical psychodiagnostic system that can function in artificially created mental health environments. The idea is to simulate both a psychodiagnostic system and a clinician’s strategies in order to learn about computer as well as human information processing. An inductive method for teaching humans the elements of the diagnostic system and its solutions is also introduced.     

Difference measurement spaces

An absolute-difference measurement space is a pair (X, e) where the real-valued function e on X² satisfies conditions which are shown in the paper to be necessary and sufficient for its representability by the absolute distance on the real line. A positive-difference measurement space is a pair (X, l), where the real-valued function l on X² satisfies conditions necessary and sufficient for its representability by positive distances on the real line. The conditions imposed on e and l make these functions extensive measurements of proximity and dominance, the two basic predicates of social enquiry. Another way of treating these conditions is to translate them to the formal language of multivalued logic. The translation is easy and the sentences obtained have plausible intuitive meanings such as reflexivity, symmetry, and transitivity. The two sets of conditions thus become formal theories of proximity and dominance. Our difference measurement spaces are relational structures for the multi-valued logic and models of the two formal theories. Thus proximity and dominance are considered dichotomous in principle and the multiple truth-values represent degrees of error. We suggest adopting multivalued logic as a framework within which the problem of measurement error can be treated together with the formal axiomatization of social and phychological theories.     

Dissimilarity cumulation theory in arc-connected spaces

This paper continues the development of the Dissimilarity Cumulation theory and its main psychological application, Universal Fechnerian Scaling [Dzhafarov, E.N and Colonius, H. (2007). Dissimilarity Cumulation theory and subjective metrics. Journal of Mathematical Psychology, 51, 290-304]. In arc-connected spaces the notion of a chain length (the sum of the dissimilarities between the chain’s successive elements) can be used to define the notion of a path length, as the limit inferior of the lengths of chains converging to the path in some well-defined sense. The class of converging chains is broader than that of converging inscribed chains. Most of the fundamental results of the metric-based path length theory (additivity, lower semicontinuity, etc.) turn out to hold in the general dissimilarity-based path length theory. This shows that the triangle inequality and symmetry are not essential for these results, provided one goes beyond the traditional scheme of approximating paths by inscribed chains. We introduce the notion of a space with intermediate points which generalizes (and specializes to when the dissimilarity is a metric) the notion of a convex space in the sense of Menger. A space is with intermediate points if for any distinct there is a different point such that (where D is dissimilarity). In such spaces the metric G induced by D is intrinsic: coincides with the infimum of lengths of all arcs connecting to In Universal Fechnerian Scaling D stands for either of the two canonical psychometric increments and (ψ denoting discrimination probability). The choice between the two makes no difference for the notions of arc-connectedness, convergence of chains and paths, intermediate points, and other notions of the Dissimilarity Cumulation theory.