We propose a separation logic where resources are histories (sequences) of epistemic actions so that resource update means concatenation of histories and resource decomposition means splitting of histories. This separation logic, called AMHSL, allows us to reason about the past: does what is true now depend on what was true in the past, before certain actions were executed? We show that the multiplicative connectives can be eliminated from a logical language with also epistemic and action model (...) modalities, if the horizon of epistemic actions is bounded. (shrink)

One might poetically muse that computers have the essence both of logic and machines. Through the case of the history of Separation Logic, we explore how this assertion is more than idle poetry. Separation Logic works because it merges the software engineer’s conceptual model of a program’s manipulation of computer memory with the logical model that interprets what sentences in the logic are true, and because it has a proof theory which aids in the (...) crucial problem of scaling the reasoning task. Scalability is a central problem, and some would even say the central problem, in appli- cations of logic in computer science. Separation Logic is an interesting case because of its widespread success in verification tools. For these two senses of model—the engineering/conceptual and the logical—to merge in a genuine sense, each must maintain their norms of use from their home disciplines. When this occurs, both the logic and engineering benefit greatly. Seeking this intersection of two different senses of model provides a strategy for how computer scientists and logicians may be successful. Furthermore, the history of Separation Logic for analysing programs provides a novel case for philosophers of science of how software engineers and computer scientists develop models and the components of such models. We provide three contributions: an exploration of the extent of models merging that is necessary for success in computer science; an introduction to the technical details of Separation Logic, which can be used for reasoning about other exhaustible resources; and an introduction to the problems, process, and results of computer scientists for those outside the field. (shrink)

In this paper we present an extension of (bunched) separation logic, Boolean BI, with epistemic and dynamic epistemic modalities. This logic, called action model separation logic ( \(\mathrm {AMSL}\) ), can be seen as a generalization of public announcement separation logic in which we replace public announcements with action models. Then we not only model public information change (public announcements) but also non-public forms of information change, such as private announcements. In this context (...) the semantics for the connectives \(*\) and \(\mathrel {-*}\) from separation logic are epistemic versions of their usual semantics. This is because formulas are interpreted in states, not in resources, and agents may be uncertain between different states representing the same resource. We present the logic \(\mathrm {AMSL}\) and its semantics, with a detailed case study that highlights its interest for modeling. We also prove the elimination of the dynamics modalities and discuss some alternative epistemic semantics for the separation connectives. (shrink)

Like modal logic, temporal logic, and description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoare triples. In this survey, we present similarities between separation logic as an (...) assertion language and modal and temporal logics. Moreover, we propose a selection of landmark results about decidability, complexity and expressive power. (shrink)

Reasoning about concurrent programs involves representing the information that concurrent processes manipulate disjoint portions of memory. In sophisticated applications, the division of memory between processes is not static. Through operations, processes can exchange the implied ownership of memory cells. In addition, processes can also share ownership of cells in a controlled fashion as long as they perform operations that do not interfere, e.g., they can concurrently read shared cells. Thus the traditional paradigm of distributed computing based on locations is replaced (...) by a paradigm of concurrent computing which is more tightly based on program structure. Concurrent Separation Logic with Permissions, developed by O’Hearn, Bornat et al., is able to represent sophisticated transfer of ownership and permissions between processes. We demonstrate how these ideas can be used to reason about fine-grained concurrent programs which do not employ explicit synchronization operations to control interference but cooperatively manipulate memory cells so that interference is avoided. Reasoning about such programs is challenging and appropriate logical tools are necessary to carry out the reasoning in a reliable fashion. We argue that Concurrent Separation Logic with Permissions provides such tools. We illustrate the logical techniques by presenting the proof of a concurrent garbage collector originally studied by Dijkstra et al., and extended by Lamport to handle multiple user processes. (shrink)

Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement a...

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega $ implies that the modal logic $\mathbf {S4.1.2}$ is complete with respect to the Čech–Stone compactification of the natural numbers, the space $\beta \omega $. In the same fashion we prove that the modal logic $\mathbf {S4}$ is complete with respect to the space $\omega ^*=\beta \omega \setminus \omega $. This improves the results of G. Bezhanishvili and J. Harding in (...) [4], where the authors prove these theorems under stronger assumptions. Our proof is also somewhat simpler. (shrink)

When we reason about strategic games, implicitly we need to reason about arbitrary strategy profiles and how players can improve from each profile. This structure is exponential in the number of players. Hence it is natural to look for subclasses of succinct games for which we can reason directly by interpreting formulas on the (succinct) game description rather than on the associated improvement structure. Priority separable games are one of such subclasses: payoffs are specified for pairwise interactions, and from these, (...) payoffs are computed for strategy profiles. We show that equilibria in such games can be described in Monadic Least Fixed Point Logic (MLFP). We then extend the description to games over arbitrarily many players, but using the monadic least fixed point extension of existential second order logic. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

We aim at developing a systematic method of separating omniscience principles by constructing Kripke models for intuitionistic predicate logic $\mathbf {IQC}$ and first-order arithmetic $\mathbf {HA}$ from a Kripke model for intuitionistic propositional logic $\mathbf {IPC}$. To this end, we introduce the notion of an extended frame, and show that each IPC-Kripke model generates an extended frame. By using the extended frame generated by an IPC-Kripke model, we give a separation theorem of a schema from a set (...) of schemata in $\mathbf {IQC}$ and a separation theorem of a sentence from a set of schemata in $\mathbf {HA}$. We see several examples which give us separations among omniscience principles. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

We study hybrid logics in topological semantics. We prove that hybrid logics of separation axioms are complete with respect to certain classes of finite topological models. This characterisation allows us to obtain several further results. We prove that aforementioned logics are decidable and PSPACE-complete, the logics of T 1 and T 2 coincide, the logic of T 1 is complete with respect to two concrete structures: the Cantor space and the rational numbers.

This paper is dedicated to Newton da Costa, who,among his many achievements, was the first toaim at dualising intuitionism in order to produce paraconsistent logics,the C-systems. This paper similarly dualises intuitionism to aparaconsistent logic, but the dual is a different logic, namely closed setlogic. We study the interaction between the properties of topologicalspaces, particularly separation properties, and logical theories on thosespaces. The paper begins with a brief survey of what is known about therelation between topology and modal (...) logic, intuitionist logic and paraconsistentlogic in respect of the incompleteness and inconsistency of theories.Necessary and sufficient conditions which relate the T1-property to theproperties of logical theories, are obtained. The result is then extendedto Hausdorff and Normal spaces. In the final section these methods areused to vary the modelling conditions for identity. (shrink)

This paper is dedicated to Newton da Costa, who,among his many achievements, was the first toaim at dualising intuitionism in order to produce paraconsistent logics,the C-systems. This paper similarly dualises intuitionism to aparaconsistent logic, but the dual is a different logic, namely closed setlogic. We study the interaction between the properties of topologicalspaces, particularly separation properties, and logical theories on thosespaces. The paper begins with a brief survey of what is known about therelation between topology and modal (...) logic, intuitionist logic and paraconsistentlogic in respect of the incompleteness and inconsistency of theories.Necessary and sufficient conditions which relate the T 1-property to theproperties of logical theories, are obtained. The result is then extendedto Hausdorff and Normal spaces. In the final section these methods areused to vary the modelling conditions for identity. (shrink)

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega $ implies that the modal logic $\mathbf {S4.1.2}$ is complete with respect to the Čech–Stone compactification of the natural numbers, the space $\beta \omega $. In the same fashion we prove that the modal logic $\mathbf {S4}$ is complete with respect to the space $\omega ^*=\beta \omega \setminus \omega $. This improves the results of G. Bezhanishvili and J. Harding in (...) [4], where the authors prove these theorems under stronger assumptions. Our proof is also somewhat simpler. (shrink)

Variants of classical linear logics are presented based on the modal version of new structural rule !?mingle instead of the known rules !weakening and ?weakening. The cut-elimination theorems, the completeness theorems and a characteristic property named the mix separation principle are proved for these logics.

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on substructural logics over the full Lambek Calculus [34], Galatos and Ono [18], Galatos et al. [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic (...) associated with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics. Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit. (shrink)

In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any normal modal logic is equivalent to the so-called super-embedding property of a suitable class of modal algebras. The joint embedding property of a class of algebras is equivalent to the Pseudo-Relevance Property. We consider connections of the above-mentioned properties with interpolation and amalgamation. Also an algebraic equivalent of of the principle of variable separation in superintuitionistic (...) logics will be found. (shrink)

Though it''s difficult to agree on the exact date of their union, logic and artificial intelligence (AI) were married by the late 1950s, and, at least during their honeymoon, were happily united. What connubial permutation do logic and AI find themselves in now? Are they still (happily) married? Are they divorced? Or are they only separated, both still keeping alive the promise of a future in which the old magic is rekindled? This paper is an attempt to answer (...) these questions via a review of six books. Encapsulated, our answer is that (i) logic and AI, despite tabloidish reports to the contrary, still enjoy matrimonial bliss, and (ii) only their future robotic offspring (as opposed to the children of connectionist AI) will mark real progress in the attempt to understand cognition. (shrink)

La première édition, accompagnée d’une traduction française annotée, du témoignage des Communia logice sur l’abstraction, en fait la double abstraction, et la séparation - un thème philosophique dans la mouvance de Métaphysique, E, 1 notoirement présent, on l’a vu, à la même époque chez Thomas d’Aquin - est ici précédée d’une étude d’histoire littéraire et doctrinale de cette compilation exégétique de questions sur la logique contenue dans un manuscrit ayant appartenu à Pierre de Limoges, maître à la Faculté des arts (...) de l’Université de Paris au plus tard en 1260-1261 et peut-être responsable de l’insertion inattendue ainsi que de la structuration par amalgame dudit témoignage, en forme de débat sur le sujet des sciences mathématiques, dans le commentaire sur le prédicament de la quantité dans les Catégories. (shrink)

The separation of Avicenna between Essence and Existence influenced logic and Arab and Muslim logicians in the Middle Ages among them Ibn al-Nafīs (1208-1288). Under this influence he contributed to the development of logic and especially the theory of the universal term. By means of the consequences of this analysis:-It has become possible to make a distinction between abstract concepts and formal concepts independent of any sensible reality, and hence the questioning of Aristotelian categories, that is to (...) say the ability to conceive for Ibn al-Nafīs like Avicenna, subjects and predicates which are not necessarily words expressing or belonging to one of the Aristotelian categories.-The analysis of the universal proposition as a conditional proposition, which made easier the distinction between absolute proposition which has no existential implication, and the other which differ from the first by an affirmation of explicit existence. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We generically construct a model in which the [math]-separation property is true, i.e. every pair of disjoint [math]-sets can be separated by a [math]-definable set. This answers an old question from the problem list “Surrealist landscape with figures” by A. Mathias from 1968. We also construct a model in which the (lightface) [math]-separation property is true.

Standard derivations of the Bell inequalities assume a common-commoncause-system that is a common screener-off for all correlations and some additional assumptions concerning locality and no-conspiracy. In a recent paper Graßhoff et al., "The British Journal for the Philosophy of Science", 56, 663–680 ) Bell inequalities have been derived via separate common causes assuming perfect correlations between the events. In the paper it will be shown that the assumptions of this separate-common-cause-type derivation of the Bell inequalities in the case of perfect (...) correlations can be reduced to the assumptions of a common-common-cause-system-type derivation. However, in the case of non-perfect correlations a non-reducible separate-common-cause-type derivation of some Bell-like inequalities can be given. The violation of these Bell-like inequalities proves Szabo's ) conjecture concerning the non-existence of a local, non-conspiratorial, separate-common-cause-model for a δ-neighborhood of perfect EPR correlations. (shrink)

Epistemic logics based on the possible worlds semantics suffer from the problem of logical omniscience, whereby agents are described as knowing all logical consequences of what they know, including all tautologies. This problem is doubly challenging: on the one hand, agents should be treated as logically non-omniscient, and on the other hand, as moderately logically competent. Many responses to logical omniscience fail to meet this double challenge because the concepts of knowledge and reasoning are not properly separated. In this paper, (...) I present a dynamic logic of knowledge that models an agent’s epistemic state as it evolves over the course of reasoning. I show that the logic does not sacrifice logical competence on the altar of logical non- omniscience. (shrink)

This paper raises some questions about the formalization of sentences containing ‘if’ or similar expressions. In particular, it focuses on three kinds of sentences that resemble conditionals in some respects but exhibit distinctive logical features that deserve separate consideration: whether-or-not sentences, biscuit conditionals, and concessive conditionals. As will be suggested, the examples discussed show in different ways that an adequate formalization of a sentence must take into account the content expressed by the sentence. This upshot is arguably what one should (...) expect on the view that logical form is determined by truth conditions. (shrink)

According to logical inferentialists, the meanings of logical expressions are fully determined by the rules for their correct use. Two key proof-theoretic requirements on admissible logical rules, harmony and separability, directly stem from this thesis—requirements, however, that standard single-conclusion and assertion-based formalizations of classical logic provably fail to satisfy :1035–1051, 2011). On the plausible assumption that our logical practice is both single-conclusion and assertion-based, it seemingly follows that classical logic, unlike intuitionistic logic, can’t be accounted for in (...) inferentialist terms. In this paper, I challenge orthodoxy and introduce an assertion-based and single-conclusion formalization of classical propositional logic that is both harmonious and separable. In the framework I propose, classicality emerges as a structural feature of the logic. (shrink)

Although logical empiricism is now mostly decried, their naturalist claim that the content of a theory can be read off from its structure, without any philosophical considerations needed, still supports traditional strategies to escape cases of underdetermination. The appeal to theoretical equivalence or to theoretical virtues, for instance, both assume that there is a neutral standpoint from which the structure of the theories can be analyzed, the physically relevant from the superfluous separated, and a comparison made between their theoretical content (...) and virtues. In my dissertation, I examine the presuppositions upon which such strategies depend. I argue that the methodological principle underlying them, according to which theories with no superfluous structure should be preferred, is unpractical, for what constitutes relevant structure is determined by epistemic considerations about the aim of scientific theories. In chapter 1, I analyze the claim that theories with ordinary bosons and fermions are theoretically equivalent to theories with exotic `paraparticles'. I argue that this claim does not do justice to the latter, as the proof is formulated in a vocabulary parochial to the former and thus favors one of the theory while giving an impoverished version of the second. In chapter 2, I examine recent arguments to the effects that any interpretation of Quantum Mechanics that can offer a no-go theorem against paraparticles possesses an explanatory advantage over other interpretations and should, as such, be favored over others. Given that most physicists consider paraparticles as surplus structure whose non-observation does not require an explanation, I evaluate arguments of both sides and suggest a third way to approach the question. Finally, in chapter 3, I turn my attention to methods for excluding another kind of unphysical structure, mathematical artifacts, from rival dark matter models. Simulations are our only window into what rival models predict about the universe’s structure. But for them to play a useful role in generating knowledge, we need to distinguish reliably between real predictions and artifacts. I argue that robustness analysis fails to fulfill this task. I propose in its place another methodology, that of crucial simulations. (shrink)

Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can be (...) also interpreted as purely mathematical or logical “force” or “interaction” as a corollary from its ontomathematical (rather than physical) realization. The ontomathematical approach to gravitation is implicit in general relativity equating it to operators in pseudo-Riemannian space obeying the Einstein field equation and also well-known by the “geometrization of physics”. Quantum mechanics shares the same by the separable complex Hilbert space and defining “physical quantity” by the Hermitian operators on it. One can interpret special Minkowski space involved by special relativity and the qubit Hilbert space of quantum information as Fourier counterparts immediately noticing that general relativity means gravitation as the Fourier counterpart of non-Hermitian operators implying non-unitarity and the violation of energy conservation and thus destroying Pauli’s particle paradigm. Since the Standard model obeys it, this explains the impossibility of “quantum gravitation” in any framework conservatively generalizing the Standard model so that it would include gravitation along with electromagnetic, weak, and strong interactions. Einstein’s geometrization of gravitation can be continued into a purely mathematical theory of it following Euclid’s realization for geometry to be exhaustively built in a deductive and axiomatic way as well as Riemann’s parametrization of all the class of Euclidean and non-Euclidean geometries by “space curvature”, then being generalized to Minkowski space as the operators on pseudo-Riemannian space as the Einstein field equation means gravitation. The transition from mathematical gravitation to logical one can rely on the historical lesson of the pair of Lobachevski’s and Riemann’s approaches now “reversely”, i.e., from the latter to the former. Logical gravitation is linkable to Hegel’s dialectical logic and ontological dialectics abandoning their interpretations as a new zero logic substituting classical propionyl logic. The approach of ontomathematics generalizing that of ontology, traceable even to Aristotle’s reformation of Plato’s doctrine, needs Hegel’s doctrine to be formalized as a first-order logic naturally containing Boolean algebra, isomorphic to both classical propositional logic and set theory being the class of all first-order logics, as a sub-logic along with Peano arithmetic as another sub-logic. The first-order logic at issue is called Hilbert arithmetic and elaborated in detail in other papers. It allows for both self-foundation of mathematics to be internally proved as complete and furthermore, quantum mechanics reinterpreted as quantum information to be included by the qubit Hilbert space interpretable in turn as a dual and physical counterpart of Hilbert arithmetic in a narrow sense, that is, both counterparts constitute Hilbert arithmetic in a wide sense, being mathematical and physical simultaneously and thus overcoming the Cartesian dualism of “body” gapped from “mind” by an abyss. Then, the proper philosophical interpretation of gravitation to be the fundamental ontomathematical force or interaction overcomes the ridiculous belief of the Big Bang wrongly alleged to be a scientific theory. Ontomathematical gravitation suggests an omnipresent and omnitemporal medium of “God’s” creation “ex nihilo” following only the natural necessity of quantum-information conservation particularly and locally manifested as energy conservation. (shrink)

We provide a sucient frame-theoretic condition for a super bi-intuitionistic logic to have Maksimova's variable separation property. We conclude that bi-intuitionistic logic enjoys the property. Furthermore, we offer an algebraic characterization of the super-bi-intuitionistic logics with Maksimova's property.

I try to identify elements of our mental capacities that separate us from animals. I focus on our command of logical concepts, demonstrable already in children in the second or third year of their life, which to date no animal has been shown to master. I draw various conclusions about the behavioural, intellectual, emotional, and moral capacities that depend on this mastery, and discuss recent empirical research that either supports or apparently disagrees with the claim that animals, even those we (...) consider intelligent, are limited in these respects. My discussion is built around observations extracted from Wittgenstein. (shrink)

Is business intimately related to ethics or can the two be separated? I argue that examining this question by focusing on how the two areas might be separated is logically flawed. Examining how business and ethics are connected, however, can bear fruit. This examination shows that business is a proper subset of ethics. Understanding this intimate connection has two practical benefits. It removes the seemingly incommensurable conflict between financial and ethical responsibilities of managers and it gives us new and positive (...) insights into Milton Friedman’s view that the social responsibility of business is to increase its profits. (shrink)

The paper explores a Fregean inspired conception on what concerns the nature of logical laws. A basic idea is that logic must ‘take care of itself’, i.e., nothing topic-specific could play the role of ground for a logical law. In this Fregean mood, we’ll see as isolating logical laws requires to separate being true from taken to be true. Such a path will lead us through a discussion on the role of representation in its relation to the true and (...) the false. Logic’s proper justification (proof) concerns returning to more basic truths, but justifying such truths is something beyond its scope. According to Frege, logical laws are grounded solely on being true, which brings us back to the question about these laws’ relation to topic-specific matters, as well as their revision. (shrink)

This anthology contains revised versions of selected papers presented at the the fourth bi-annual international deontic logic conference, DEON’06. There is a substantial introduction (see separate entry), papers from all four invited speakers, David Makinson, Donald Nute, Claudio Pizzi, and Georg Von Wright. After the introduction and lead chapter "Deontic Logic - as I See It" by G.H. von Wright, there are nineteen articles grouped under six headings, "Norms and Truth", "Agency and Time", "Analysis of Normative Conflicts", "Defeasibility (...) and Norm Conflicts", Computer System Applications", and "Combinations of Logics". The collection contains a number of influential articles and a large array of key authors in deontic logic contribute. (shrink)