Judea Pearl (2000) was the first to propose a definition of actual causation using causal models. A number of authors have suggested that an adequate account of actual causation must appeal not only to causal structure but also to considerations of normality. In Halpern and Hitchcock (2011), we offer a definition of actual causation using extended causal models, which include information about both causal structure and normality. Extended causal models are potentially very complex. In this study, we show how it (...) is possible to achieve a compact representation of extended causal models. (shrink)

A structure which generalizes formulas by including substitution terms is used to represent proofs in classical logic. These structures, called expansion trees, can be most easily understood as describing a tautologous substitution instance of a theorem. They also provide a computationally useful representation of classical proofs as first-class values. As values they are compact and can easily be manipulated and transformed. For example, we present an explicit transformations between expansion tree proofs and cut-free sequential proofs. A theorem prover (...) which represents proofs using expansion trees can use this transformation to present its proofs in more human-readable form. Also a very simple computation on expansion trees can transform them into Craig-style linear reasoning and into interpolants when they exist. We have chosen a sublogic of the Simple Theory of Types for our classical logic because it elegantly represents substitutions at all finite types through the use of the typed -calculus. Since all the proof-theoretic results we shall study depend heavily on properties of substitutions, using this logic has allowed us to strengthen and extend prior results: we are able to prove a strengthen form of the firstorder interpolation theorem as well as provide a correct description of Skolem functions and the Herbrand Universe. The latter are not straightforward generalization of their first-order definitions. (shrink)

In this paper we define sheaf spaces of BL-algebras (or BL-sheaf spaces), we study completely regular and compact BL-sheaf spaces and compact representations of BL-algebras and, finally, we prove that the category of non-trivial BL-algebras is equivalent with the category of compact local BL-sheaf spaces.

For a locally compact group G, we show that it is possible to present the class of continuous unitary representations of G as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how nondegenerate ∗-representations of a general ∗-algebra A (with some mild assumptions) can be viewed as an elementary class, in a many-sorted language, and use the correspondence between continuous unitary representations of G and nondegenerate ∗-representations of L1(G). We relate the (...) notion of ultraproduct of logical structures, under this presentation, with other notions of ultraproduct of representations appearing in the literature, and we characterize property (T) for G in terms of the definability of the sets of fixed points of L1 functions on G. (shrink)

We prove a compactness theorem for pseudopower operations of the form \}\) where \\le {{\,\mathrm{cf}\,}}\). Our main tool is a result that has Shelah’s cov versus pp Theorem as a consequence. We also show that the failure of compactness in other situations has significant consequences for pcf theory, in particular, implying the existence of a progressive set A of regular cardinals for which \\) has an inaccessible accumulation point.

This paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.

Let X be a Polish space and a separable compact subset of the first Baire class on X. For every sequence dense in , the descriptive set-theoretic properties of the set are analyzed. It is shown that if is not first countable, then is -complete. This can also happen even if is a pre-metric compactum of degree at most two, in the sense of S. Todorčević. However, if is of degree exactly two, then is always Borel. A deep result (...) of G. Debs implies that contains a Borel cofinal set and this gives a tree-representation of . We show that classical ordinal assignments of Baire-1 functions are actually -ranks on . We also provide an example of a Ramsey-null subset A of for which there does not exist a Borel set BA such that the difference BA is Ramsey-null. (shrink)

Relativistic geometrical action for a quantum particle in the superspace is analyzed from theoretical group point of view. To this end an alternative technique of quantization outlined by the authors in a previous work and that is based in the correct interpretation of the square root Hamiltonian, is used. The obtained spectrum of physical states and the Fock construction consist of Squeezed States which correspond to the representations with the lowest weights $\lambda=\frac{1}{4}$ and $\lambda=\frac{3}{4}$ with four possible (non-trivial) fractional representations (...) for the group decomposition of the spin structure. From the theory of semigroups the analytical representation of the radical operator in the superspace is constructed, the conserved currents are computed and a new relativistic wave equation is proposed and explicitly solved for the time-dependent case. The relation with the Relativistic Schrödinger equation and the Time-dependent Harmonic Oscillator is analyzed and discussed. (shrink)

Relativistic geometrical action for a quantum particle in the superspace is analyzed from theoretical group point of view. To this end an alternative technique of quantization outlined by the authors in a previous work and, that is, based in the correct interpretation of the square root Hamiltonian, is used. The obtained spectrum of physical states and the Fock construction consist of Squeezed States which correspond to the representations with the lowest weights \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$${\lambda=\frac{1}{4}}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\frac{3}{4}}$$\end{document} with four possible fractional representations for the group decomposition of the spin structure. From the theory of semi-groups the analytical representation of the radical operator in the superspace is constructed, the conserved currents are computed and a new relativistic wave equation is proposed and explicitly solved for the time dependent case. The relation with the Relativistic Schrödinger equation and the Time-dependent Harmonic Oscillator is analyzed and discussed. (shrink)

In this paper we develop a general representation theory for MV-algebras. We furnish the appropriate categorical background to study this problem. Our guide line is the theory of classifying topoi of coherent extensions of universal algebra theories. Our main result corresponds, in the case of MV-algebras and MV-chains, to the representation of commutative rings with unit as rings of global sections of sheaves of local rings. We prove that any MV-algebra is isomorphic to the MV-algebra of all global (...) sections of a sheaf of MV-chains on a compact topological space. This result is intimately related to McNaughton’s theorem, and we explain why our representation theorem can be viewed as a vast generalization of McNaughton’s theorem. In spite of the language used in this abstract, we have written this paper in the hope that it can be read by experts in MV-algebras but not in sheaf theory, and conversely. (shrink)

I present solutions to several questions of Paul Bankston [2] by means of another version of the ultracoproduct construction, and explain the relation of ultracoproduct of compact Hausdorff spaces to other constructions combining topology, algebra and logic.

Yu, X., Riesz representation theorem, Borel measures and subsystems of second-order arithmetic, Annals of Pure and Applied Logic 59 65-78. Formalized concept of finite Borel measures is developed in the language of second-order arithmetic. Formalization of the Riesz representation theorem is proved to be equivalent to arithmetical comprehension. Codes of Borel sets of complete separable metric spaces are defined and proved to be meaningful in the subsystem ATR0. Arithmetical transfinite recursion is enough to prove the measurability of Borel (...) sets for any finite Borel measure on a compact complete separable metric space. (shrink)

The domain of numbers provides a paradigmatic case for investigating interactions of culture, language, and cognition: Numerical competencies are considered a core domain of knowledge, and yet the development of specifically human abilities presupposes cultural and linguistic input by way of counting sequences. These sequences constitute systems with distinct structural properties, the cross-linguistic variability of which has implications for number representation and processing. Such representational effects are scrutinized for two types of verbal numeration systems—general and object-specific ones—that were in (...) parallel use in several Oceanic languages. The analysis indicates that the object-specific systems outperform the general systems with respect to counting and mental arithmetic, largely due to their regular and more compact representation. What these findings reveal on cognitive diversity, how the conjectures involved speak to more general issues in cognitive science, and how the approach taken here might help to bridge the gap between anthropology and other cognitive sciences is discussed in the conclusion. (shrink)

The physical meaning of the particularly simple non-degenerate supermetric, introduced in the previous part by the authors, is elucidated and the possible connection with processes of topological origin in high energy physics is analyzed and discussed. New possible mechanism of the localization of the fields in a particular sector of the supermanifold is proposed and the similarity and differences with a 5-dimensional warped model are shown. The relation with gauge theories of supergravity based in the OSP(1/4) group is explicitly given (...) and the possible original action is presented. We also show that in this non-degenerate super-model the physic states, in contrast with the basic states, are observables and can be interpreted as tomographic projections or generalized representations of operators belonging to the metaplectic group Mp(2). The advantage of geometrical formulations based on non-degenerate super-manifolds over degenerate ones is pointed out and the description and the analysis of some interesting aspects of the simplest Riemannian superspaces are presented from the point of view of the possible vacuum solutions. (shrink)

Thinking about space is thinking about spatial things. The table is on the carpet; hence the carpet is under the table. The vase is in the box; hence the box is not in the vase. But what does it mean for an object to be somewhere? How are objects tied to the space they occupy? This book is concerned with these and other fundamental issues in the philosophy of spatial representation. Our starting point is an analysis of the interplay (...) between mereology (the study of part/whole relations), topology (the study of spatial continuity and compactness), and the theory of spatial location proper. This leads to a unified framework for spatial representation understood quite broadly as a theory of the representation of spatial entities. The framework is then tested against some classical metaphysical questions such as: Are parts essential to their wholes? Is spatial colocation a sufficient criterion of identity? What (if anything) distinguishes material objects from events and other spatial entities? The concluding chapters deal with applications to topics as diverse as the logical analysis of movement and the semantics of maps. (shrink)

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible (...) K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)

In this paper, inspired by methods of Bigard, Keimel, and Wolfenstein , we develop an approach to sheaf representations of MV-algebras which combines two techniques for the representation of MV-algebras devised by Filipoiu and Georgescu and by Dubuc and Poveda . Following Davey approach , we use a subdirect representation of MV-algebras that is based on local MV-algebras. This allowed us to obtain: a representation of any MV-algebras as MV-algebra of all global sections of a sheaf of (...) local MV-algebras on the spectruum of its prime ideals; a representation of MV-algebras, having the space of minimal prime ideals compact, as MV-algebra of all global sections of a Hausdorff sheaf of MV-chains on the space of minimal prime ideals, which is a Stone space; an adjunction between the category of all MV-algebras and the category of MV-algebraic spaces, where an MV-algebraic space is a pair , where X is a compact topological space and F is a sheaf of MV-algebras with stalks that are local. (shrink)

In this paper we develop a general representation theory for MV-algebras. We furnish the appropriate categorical background to study this problem. Our guide line is the theory of classifying topoi of coherent extensions of universal algebra theories. Our main result corresponds, in the case of MV-algebras and MV-chains, to the representation of commutative rings with unit as rings of global sections of sheaves of local rings. We prove that any MV-algebra is isomorphic to the MV-algebra of all global (...) sections of a sheaf of MV-chains on a compact topological space. This result is intimately related to McNaughton’s theorem, and we explain why our representation theorem can be viewed as a vast generalization of McNaughton’s theorem. In spite of the language used in this abstract, we have written this paper in the hope that it can be read by experts in MV-algebras but not in sheaf theory, and conversely. (shrink)

The application of deep learning methods to problems in natural language processing has generated significant progress across a wide range of natural language processing tasks. For some of these applications, deep learning models now approach or surpass human performance. While the success of this approach has transformed the engineering methods of machine learning in artificial intelligence, the significance of these achievements for the modelling of human learning and representation remains unclear. Deep Learning and Linguistic Representation looks at the (...) application of a variety of deep learning systems to several cognitively interesting NLP tasks. It also considers the extent to which this work illuminates our understanding of the way in which humans acquire and represent linguistic knowledge. Key Features: combines an introduction to deep learning in AI and NLP with current research on Deep Neural Networks in computational linguistics. is self-contained and suitable for teaching in computer science, AI, and cognitive science courses; it does not assume extensive technical training in these areas. provides a compact guide to work on state of the art systems that are producing a revolution across a range of difficult natural language tasks. (shrink)

Prioritized bases, i.e., weakly ordered sets of sentences, have been used for specifying an agent’s ‘basic’ or ‘explicit’ beliefs, or alternatively for compactly encoding an agent’s belief state without the claim that the elements of a base are in any sense basic. This paper focuses on the second interpretation and shows how a shifting of priorities in prioritized bases can be used for a simple, constructive and intuitive way of representing a large variety of methods for the change of belief (...) states—methods that have usually been characterized semantically by a system-of-spheres modeling. Among the methods represented are ‘radical’, ‘conservative’ and ‘moderate’ revision, ‘revision by comparison’ in its raising and lowering variants, as well as various constructions for belief expansion and contraction. Importantly, none of these methods makes any use of numbers. (shrink)

Let M be an MV-algebra and ΩM be the set of all σ -valuations from M into the MV-unit interval. This paper focuses on the characterization of MV-algebras using σ -valuations of MV-algebras and proves that a σ -complete MV-algebra is σ -regular, which means that a ≤ b if and only if v ≤ v for any v ∈ ΩM. Then one can introduce in a natural way a fuzzy topology δ on ΩM. The representation theorem forMV-algebras is (...) established by means of fuzzy topology. Some properties of fuzzy topology δ and its cut topology U are investigated. (shrink)

Six characteristics of effective representational systems for conceptual learning in complex domains have been identified. Such representations should: (1) integrate levels of abstraction; (2) combine globally homogeneous with locally heterogeneous representation of concepts; (3) integrate alternative perspectives of the domain; (4) support malleable manipulation of expressions; (5) possess compact procedures; and (6) have uniform procedures. The characteristics were discovered by analysing and evaluating a novel diagrammatic representation that has been invented to support students' comprehension of electricity—AVOW diagrams (...) (Amps, Volts, Ohms, Watts). A task analysis is presented that demonstrates that problem solving using a conventional algebraic approach demands more effort than AVOW diagrams. In an experiment comparing two groups of learners using the alternative approaches, the group using AVOW diagrams learned more than the group using equations and were better able to solve complex transfer problems and questions involving multiple constraints. Analysis of verbal protocols and work scratchings showed that the AVOW diagram group, in contrast to the equations group, acquired a coherently organised network of concepts, learnt effective problem solving procedures, and experienced more positive learning events. The six principles of effective representations were proposed on the basis of these findings. AVOW diagrams are Law Encoding Diagrams, a general class of representations that have been shown to support learning in other scientific domains. (shrink)

Six characteristics of effective representational systems for conceptual learning in complex domains have been identified. Such representations should: (1) integrate levels of abstraction; (2) combine globally homogeneous with locally heterogeneous representation of concepts; (3) integrate alternative perspectives of the domain; (4) support malleable manipulation of expressions; (5) possess compact procedures; and (6) have uniform procedures. The characteristics were discovered by analysing and evaluating a novel diagrammatic representation that has been invented to support students' comprehension of electricity—AVOW diagrams (...) (Amps, Volts, Ohms, Watts). A task analysis is presented that demonstrates that problem solving using a conventional algebraic approach demands more effort than AVOW diagrams. In an experiment comparing two groups of learners using the alternative approaches, the group using AVOW diagrams learned more than the group using equations and were better able to solve complex transfer problems and questions involving multiple constraints. Analysis of verbal protocols and work scratchings showed that the AVOW diagram group, in contrast to the equations group, acquired a coherently organised network of concepts, learnt effective problem solving procedures, and experienced more positive learning events. The six principles of effective representations were proposed on the basis of these findings. AVOW diagrams are Law Encoding Diagrams, a general class of representations that have been shown to support learning in other scientific domains. (shrink)

We describe a linguistic pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of corpus data. This is achieved by compactly coding recursively structured constituent patterns, and by placing strings that have an identical backbone and similar context structure into the same equivalence class. The resulting representations constitute an efficient encoding of linguistic knowledge and support systematic generalization to unseen sentences.

The use of the axial vector representing a three-dimensional rotation makes the rotation representation much more compact by extending the trigonometric functions to vectorial arguments. Similarly, the pure Lorentz transformations are compactly treated by generalizing a scalar rapidity to a vector quantity in spatial three-dimensional cases and extending hyperbolic functions to vectorial arguments. A calculation of the Wigner rotation simplified by using the extended functions illustrates the fact that the rapidity vector space obeys hyperbolic geometry. New representations bring (...) a Lorentz-invariant fundamental equation of motion corresponding to the Galilei-invariant equation of Newtonian mechanics. (shrink)

Here find four chapters as the first publication of the Woodbridge Lectures and Kant Lectures ; chapters 5 and 6, "On the Biological Basis of Language Capacities" and "Language and Unconscious Knowledge," have, substantively, appeared as parts of other books. This is an excellent book for philosophers, almost wholly given to theoretical-philosophical issues. A complementary process to the one William James outlined respecting the reception of a new idea is that the purveyor of the new idea, stung by dismissive and (...) misleading rejection and acceptance, eventually ascribes his opponent’s characterization of his own position to them. This is Chomsky’s attack on his opponent’s anti-scientific, anti-realist, speciesist, methodological, and mystical dualism. And Descartes is hardly championed. Scientific linguistics and psychology study the species-specific, componentialized, innately and biologically structured, largely unconscious and introspectively inaccessible, cognitive organs. H. Putnam’s new Kantianism is pummeled, as is Dummett’s anti-realism. The logical behaviorist-ordinary language critics are reproved, and it is curious how quaint the Wittgensteinian style impossibility-of-psychology-and-there-is-nothing-to-explain razzmatazz now seems. This is a compact, sharp, and coherent expression of themes explicit or implicit in Chomsky’s earliest work, and one not likely to be wholly pleasant to those joyed by what he was saying in the late 1960s. Whatever one’s persuasion, it also suggests that Chomsky has tried to respond to his myriad philosophical opponents comprehensively, in depth, and in detail—virtues which many of them seem shockingly unwilling to extend to him., never having read any other work of Chomsky’s or other linguists. On being shown that his paper was straight irrelevant to more than a decade of active work in linguistic theory, he seemed to take it that this suggested the moral and intellectual bankruptcy of Noam Chomsky and linguistic science.)—J.L. (shrink)

As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial intelligence to combine domain knowledge, capture causal relationships, or learn from incomplete datasets. Known as a NP-hard problem in a classical setting, Bayesian inference pops up as a class of algorithms worth to explore in a quantum framework. This paper explores such a research (...) direction and improves on previous proposals by a judicious use of the utility function in an entangled configuration. It proposes a completely quantum mechanical decision-making process with a proven computational advantage. A prototype implementation in Qiskit (a Python-based program development kit for the IBM Q machine) is discussed as a proof-of-concept. (shrink)

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal (...) form A at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem. (shrink)

The tree-based data structure of △-tree for propositional formulas is introduced in an improved and optimised form. The △-trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal (...) form A at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem. (shrink)

Mental representations are based upon categories in which the state of a mental system is stable. Acategorial states, on the other hand, are distinguished by unstable behavior. A refined and compact terminology for the description of categorial and acategorial mental states and their stability properties is introduced within the framework of the theory of dynamical systems. The relevant concepts are illustrated by selected empirical observations in cognitive neuroscience. Alterations of the category of the first person singular and features of (...) creative activity will be discussed as examples for the phenomenology of acategorial states. (shrink)

In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko —nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions, introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of κ -compactness. We are particularly interested (...) in non-topped intersection structures viewed as semi-lattices with a minimal meet-dense subset, i.e., with a minimal generator set. We study a chain condition which is sufficient for a minimal generator set, implies compactness of the logic, and in regular logics is equivalent to compactness of the consequence relation together with the existence of a inconsistent set, where κ is the cofinality of the cardinality of the logic. Some of these results are known in a similar form in the context of closure spaces, we give extensions to intersection structures and to big cardinals presenting new proofs based on set-theoretical tools. The existence of a minimal generator set is crucial for our way to define connectives. Although our method can be extended to further non-classical connectives we concentrate here on intuitionistic and infinite ones. Our approach leads us to the concept of the set of complete theories which is stable under all considered connectives and gives rise to the definition of the topological space of the logic. Topological representations of abstract logics by means of this space remain to be further investigated. (shrink)

Wigner's quantum-mechanical classification of particle-types in terms of irreducible representations of the Poincaré group has a classical analogue, which we extend in this paper. We study the compactness properties of the resulting phase spaces at fixed energy, and show that in order for a classical massless particle to be physically sensible, its phase space must feature a classical-particle counterpart of electromagnetic gauge invariance. By examining the connection between massless and massive particles in the massless limit, we also derive a classical-particle (...) version of the Higgs mechanism. (shrink)

We present a new and constructive proof of the Peter-Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C*-algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the characters of a finite group. We use this proof as a basis for a constructive proof in the style of Bishop. In fact, the present theory of compact groups may be seen (...) as a natural continuation in the line of Bishop's work on locally compact, but Abelian, groups [2]. (shrink)

We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exists seem to be very rare. It is the main purpose of this paper to prove that, nevertheless, the (...) definition has a large number of important applications. Using the framework of TTE [40], we introduce computable metric spaces and computability on the compact subsets. We prove that every computable metric space has a c-proper c-admissible representation. We prove that Turing machine time complexity of a function computable relative to c-admissible c-proper representations has a computable bound on every computable compact subset. We prove that computably compact computable metric spaces have concise c-proper c-admissible representations and show by examples that many canonical representations are of this kind. Finally, we compare our definition with a similar one by Labhalla et al. [22]. Several examples illustrate the concepts. By these results natural and realistic definitions of computational complexity are now available for a variety of numerical problems such as image processing, integration, continuous Fourier transform or wave propagation. (shrink)

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any (...) topological space form a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

On our ordinary representations of space, space is composed of indivisible, dimensionless points; extended regions are understood as infinite sets of points. Region-based theories of space reverse this atomistic picture, by taking as primitive several relations on extended regions, and recovering points as higher-order abstractions from regions. Over the years, such theories have focused almost exclusively on the topological and geometric structure of space. We introduce to region-based theories of space a new primitive binary relation (‘qualitative probability’) that is tied (...) to _measure_. It expresses that one region is _smaller than or equal in size_ to another. Algebraic models of our theory are _separation_ _σ_-_algebras with qualitative probability_: \((\mathbb {B}, \ll, \preceq )\), where \(\mathbb {B}\) is a Boolean _σ_-algebra, ≪ is a separation relation on \(\mathbb {B}\), and ≼ is a qualitative probability on \(\mathbb {B}\). We show that from algebraic models of this kind we can, in an interesting class of cases, recover a compact Hausdorff topology _X_, together with a countably additive measure _μ_ on a _σ_-field of Borel subsets of that topology, and that \((\mathbb {B}, \ll, \preceq )\) is isomorphic to a ‘standard model’ arising out of the pair (_X_, _μ_). It follows from one of our main results that any closed ball in Euclidean space, \(\mathbb {R}^{n}\), together with Lebesgue measure arises in this way from a separation _σ_-algebra with qualitative probability. (shrink)

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. (...) In this article we give a more systematic perspective on Suszko’s problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos, and Wansing, for logics with various structural properties. We strengthen these results into exact rank results for nonpermeable logics. We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties. (shrink)

Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets , introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional games. MC-nets are a rulebased formalism, in which rules take the form pattern → value, where “pattern ” is a Boolean condition over (...) agents, and “value ” is a numeric value. Ieong and Shoham showed that, for a class of what we will call “basic” MC-nets, where patterns are constrained to be a conjunction of literals, marginal contribution nets permit the easy computation of solution concepts such as the Shapley value. However, there are very natural classes of coalitional games that require an exponential number of such basic MC-net rules. We present read-once MC-nets, a new class of MC-nets that is provably more compact than basic MC-nets, while retaining the attractive computational properties of basic MC-nets. We show how the techniques we develop for read-once MC-nets can be applied to other domains, in particular, computing solution concepts in network flow games on series-parallel networks. (shrink)

© Springer-Verlag Berlin Heidelberg 2015. When reasoning about knowledge of procedures under imperfect information, the explicit representation of epistemic possibilities blows up the S5like models of standard epistemic logic. To overcome this drawback, in this paper, we propose a new logical framework based on compact models without epistemic accessibility relations for reasoning about knowledge of procedures. Inspired by the 3-valued abstraction method in model checking, we introduce hyper models which encode the imperfect procedural information. We give a highly (...) non-trivial 2-valued semantics of epistemic dynamic logic on such models while validating all the usual S5 axioms. Our approach is suitable for applications where procedural information is ‘learned’ incrementally, as demonstrated by various examples. (shrink)

An Introduction to the Philosophy of Art is a clear and compact survey of philosophical theories of the nature and value of art, including in its scope literature, painting, sculpture, music, dance, architecture, movies, conceptual art and performance art. This second edition incorporates significant new research on topics including pictorial depiction, musical expression, conceptual art, Hegel, and art and society. Drawing on classical and contemporary philosophy, literary theory and art criticism, Richard Eldridge explores the representational, formal and expressive dimensions (...) of art. He argues that the aesthetic and semantic density of the work, in inviting imaginative exploration, makes works of art cognitively, morally and socially important. This importance is further elaborated in discussions of artistic beauty, originality, imagination and criticism. His accessible study will be invaluable to students of philosophy of art and aesthetics. (shrink)

We investigate some basic descriptive set theory for countably based completely quasi-metrizable topological spaces, which we refer to as quasi-Polish spaces. These spaces naturally generalize much of the classical descriptive set theory of Polish spaces to the non-Hausdorff setting. We show that a subspace of a quasi-Polish space is quasi-Polish if and only if it is Π20 source in the Borel hierarchy. Quasi-Polish spaces can be characterized within the framework of Type-2 Theory of Effectivity as precisely the countably based spaces (...) that have an admissible representation with a Polish domain. They can also be characterized domain theoretically as precisely the spaces that are homeomorphic to the subspace of all non-compact elements of an ω-continuous domain. Every countably based locally compact sober space is quasi-Polish, hence every ω-continuous domain is quasi-Polish. A metrizable space is quasi-Polish if and only if it is Polish. We show that the Borel hierarchy on an uncountable quasi-Polish space does not collapse, and that the Hausdorff–Kuratowski theorem generalizes to all quasi-Polish spaces. (shrink)

We study the problem of embedding Halpern and Moses's modal logic of minimal knowledge states into two families of modal formalism for nonmonotonic reasoning, McDermott and Doyle's nonmonotonic modal logics and ground nonmonotonic modal logics. First, we prove that Halpern and Moses's logic can be embedded into all ground logics; moreover, the translation employed allows for establishing a lower bound (3p) for the problem of skeptical reasoning in all ground logics. Then, we show a translation of Halpern and Moses's logic (...) into a significant subset of McDermott and Doyle's formalisms. Such a translation both indicates the ability of Halpern and Moses's logic of expressing minimal knowledge states in a more compact way than McDermott and Doyle's logics, and allows for a comparison of the epistemological properties of such nonmonotonic modal formalisms. (shrink)

Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the (...) Jónsson and Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality. (shrink)

Logical geometry systematically studies Aristotelian diagrams, such as the classical square of oppositions and its extensions. These investigations rely heavily on the use of bitstrings, which are compact combinatorial representations of formulas that allow us to quickly determine their Aristotelian relations. However, because of their general nature, bitstrings can be applied to a wide variety of topics in philosophical logic beyond those of logical geometry. Hence, the main aim of this paper is to present a systematic technique for assigning (...) bitstrings to arbitrary finite fragments of formulas in arbitrary logical systems, and to study the logical and combinatorial properties of this technique. It is based on the partition of logical space that is induced by a given fragment, and sheds new light on a number of interesting issues, such as the logic-dependence of the Aristotelian relations and the subtle interplay between the Aristotelian and Boolean structure of logical fragments. Finally, the bitstring technique also allows us to systematically analyze fragments from contemporary logical systems, such as public announcement logic, which could not be done before. (shrink)