Complete Additivity and Modal Incompleteness

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, V-BAOs. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem's paper resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to V-BAOs, namely the provability logic GLB. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is V-complete. After these results, we generalize the Blok Dichotomy to degrees of V-incompleteness. In the end, we return to van Benthem's theme of syntactic aspects of modal incompleteness

A One Category Ontology

I defend a one category ontology: an ontology that denies that we need more than one fundamental category to support the ontological structure of the world. Categorical fundamentality is understood in terms of the metaphysically prior, as that in which everything else in the world consists. One category ontologies are deeply appealing, because their ontological simplicity gives them an unmatched elegance and spareness. I’m a fan of a one category ontology that collapses the distinction between particular and property, replacing it with a single fundamental category of intrinsic characters or qualities. We may describe the qualities as qualitative charactersor as modes, perhaps on the model of Aristotelian qualitative (nonsubstantial) kinds, and I will use the term “properties” interchangeably with “qualities”. The qualities are repeatable and reasonably sparse, although, as I discuss in section 2.6, there are empirical reasons that may suggest, depending on one’s preferred fundamental physical theory, that they include irreducibly intensive qualities. There are no uninstantiated qualities. I also assume that the fundamental qualitative natures are intrinsic, although physics may ultimately suggest that some of them are extrinsic. On my view, matter, concrete objects, abstract objects, and perhaps even spacetime are constructed from mereological fusions of qualities, so the world is simply a vast mixture of qualities, including polyadic properties (i.e., relations). This means that everything there is, including concrete objects like persons or stars, is a quality, a qualitative fusion, or a portion of the extended qualitative fusion that is the worldwhole. I call my view mereological bundle theory

04241 Abstracts Collection -- Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems

Recently there has been a lot of research, combining concepts of process algebra with those of the theory of graph grammars and graph transformation systems. Both can be viewed as general frameworks in which one can specify and reason about concurrent and distributed systems. There are many areas where both theories overlap and this reaches much further than just using graphs to give a graphic representation to processes. Processes in a communication network can be seen in two different ways: as terms in an algebraic theory, emphasizing their behaviour and their interaction with the environment, and as nodes (or edges) in a graph, emphasizing their topology and their connectedness. Especially topology, mobility and dynamic reconfigurations at runtime can be modelled in a very intuitive way using graph transformation. On the other hand the definition and proof of behavioural equivalences is often easier in the process algebra setting. Also standard techniques of algebraic semantics for universal constructions, refinement and compositionality can take better advantage of the process algebra representation. An important example where the combined theory is more convenient than both alternatives is for defining the concurrent (noninterleaving), abstract semantics of distributed systems. Here graph transformations lack abstraction and process algebras lack expressiveness. Another important example is the work on bigraphical reactive systems with the aim of deriving a labelled transitions system from an unlabelled reactive system such that the resulting bisimilarity is a congruence. Here, graphs seem to be a convenient framework, in which this theory can be stated and developed. So, although it is the central aim of both frameworks to model and reason about concurrent systems, the semantics of processes can have a very different flavour in these theories. Research in this area aims at combining the advantages of both frameworks and translating concepts of one theory into the other. The Dagsuthl Seminar, which took place from 06.06. to 11.06.2004, was aimed at bringing together researchers of the two communities in order to share their ideas and develop new concepts. These proceedings4 of the do not only contain abstracts of the talks given at the seminar, but also summaries of topics of central interest. We would like to thank all participants of the seminar for coming and sharing their ideas and everybody who has contributed to the proceedings

On the preciseness of subtyping in session types

Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the greatest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known session subtyping, the branching-selection subtyping, is sound and complete for the synchronous calculus. Next we show that in the asynchronous calculus, this subtyping is incomplete for type-safety: that is, there exist session types T and S such that T can safely be considered as a subtype of S, but T ≤ S is not derivable by the subtyping. We then propose an asynchronous sub-typing system which is sound and complete for the asynchronous calculus. The method gives a general guidance to design rigorous channel-based subtypings respecting desired safety properties

The taming of recurrences in computability logic through cirquent calculus, Part I

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of negation, parallel conjunction, parallel disjunction, branching recurrence, and branching corecurrence. The article is published in two parts, with (the present) Part I containing preliminaries and a soundness proof, and (the forthcoming) Part II containing a completeness proof

Inconsistent boundaries

Research on this paper was supported by a grant from the Marsden Fund, Royal Society of New Zealand.Mereotopology is a theory of connected parts. The existence of boundaries, as parts of everyday objects, is basic to any such theory; but in classical mereotopology, there is a problem: if boundaries exist, then either distinct entities cannot be in contact, or else space is not topologically connected (Varzi in Noûs 31:26–58, 1997). In this paper we urge that this problem can be met with a paraconsistent mereotopology, and sketch the details of one such approach. The resulting theory focuses attention on the role of empty parts, in delivering a balanced and bounded metaphysics of naive space.PostprintPeer reviewe

Studies on A. Einstein , B. Podolsky and N. Rosen argument that ”quantum mechanics is not a complete theory,” I: Basic methods

In 1935, A. Einstein expressed his view, jointly with B. Podolsky and N. Rosen, that ”quantum mechanics is not a complete theory” (EPR argument). Following decades of preparatory studies, R. M. Santilli published in 1998 a paper showing that the objections against the EPR argument are valid for point-like particles in vacuum (exterior dynamical systems), but the same objections are inapplicable (rather than being violated) for extended particles within hyperdense physical media (interior dynamical systems) because the latter systems appear to admit an identical classical counterpart when treated with the isotopic branch of hadronic mathematics and mechanics. In a more recent paper, Santilli has shown that quantum uncertainties of extended particles appear to progressively tend to zero when in the interior of hadrons, nuclei and stars, and appear to be identically null at the limit of gravitational collapse, essentially along the EPR argument. In this first paper, we review, upgrade and specialize the basic mathematical, physical and chemical methods for the study of the EPR argument. In two subsequent papers, we review the above results and provide specific illustrations and applications

Optimal hedging and parameter uncertainty

We explore the impact of drift parameter uncertainty in a basis risk model, an incomplete market in which a claim on a non-traded asset is optimally hedged using a correlated traded stock. Using analytic expansions for indifference prices and hedging strategies, we develop an efficient procedure to generate terminal hedging error distributions when the hedger has erroneous estimates of the drift parameters. These show that the effect of parameter uncertainty is occasionally benign, but often very destructive. In light of this, we develop a filtering approach in which the hedger updates her parameter estimates from observations of the asset prices, and we find an analytic soultion to the hedger's combined filtering and control problem in the case that the drift of the traded asset is known with certainty