From Display to Labelled Proofs for Tense Logics

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt

On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus

The Class of All Natural Implicative Expansions of Kleene’s Strong Logic Functionally Equivalent to Łukasiewicz’s 3-Valued Logic Ł3

25 p.We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix (with both only one and two designated values) and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova (Rep Math Log 47:173–182, 2012).S

The Metaphysics of the Thin Red Line

There seems to be a minimal core that every theory wishing to accommodate the intuition that the future is open must contain: a denial of physical determinism (i.e. the thesis that what future states the universe will be in is implied by what states it has been in), and a denial of strong fatalism (i.e. the thesis that, at every time, what will subsequently be the case is metaphysically necessary). 1 Those two requirements are often associated with the idea of an objective temporal flow and the non-reality of the future. However, at least certain ways to frame the “openness” intuition do not rely on any of these. Branching Time Theory (BTT) is one such: it is compatible with the denial that time flow is objective and it is couched in a language with a (prima facie) commitment to an eternalist ontology. BTT, though, urges us to resist certain intuitions about the determinacy of future claims, which arguably do not lead either to physical determinism or to fatalism. Against BTT, supporters of the Thin Red Line Theory (TRL) argue that their position avoids determinism and fatalism, while also representing the fact that there is a future which is “special ” because it is the one that will be the case. But starting with Belnap and Green 1994, some have objected to the tenability of TRL, mainly on metaphysical grounds. In particular, those argue that “positing a thin red line amounts to giving up objective indeterminism, ” 2 and that “has unacceptable consequences, ranging from a mistreatment of actuality to an inability to talk coherently about what would have happened had what is going to happen not taken place. ” 3 In this paper, we wish to reframe the 1 Hence, strong fatalism implies physical determinism, while the latter does not imply the former, thus being compatible with the world having been otherwise, assuming that the initial condition of the world could have been otherwise. Also, strong fatalism is intended as opposed to weak fatalism, according to which, whatever I will do now won’t affect what will be the case. Weak fatalism, instead, does not imply, nor is implied, by physical determinism

Multiple Conclusion Rules in Logics with the Disjunction Property

We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a basis of admissible rules. These results can be generalized to a broad class of logics including positive logic and its extensions, Johansson logic, normal extensions of S4, n-transitive logics and intuitionistic modal logics

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

This paper employs the linear nested sequent framework to design a new cut-free calculus LNIF for intuitionistic fuzzy logic--the first-order G\"odel logic characterized by linear relational frames with constant domains. Linear nested sequents--which are nested sequents restricted to linear structures--prove to be a well-suited proof-theoretic formalism for intuitionistic fuzzy logic. We show that the calculus LNIF possesses highly desirable proof-theoretic properties such as invertibility of all rules, admissibility of structural rules, and syntactic cut-elimination.Comment: Appended version of the paper "Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents", accepted to the International Symposium on Logical Foundations of Computer Science (LFCS 2020

An Algebraic Theory for Data Linkage

There are countless sources of data available to governments, companies, and citizens, which can be combined for good or evil. We analyse the concepts of combining data from common sources and linking data from different sources. We model the data and its information content to be found in a single source by an ordered partial monoid, and the transfer of information between sources by different types of morphisms. To capture the linkage between a family of sources, we use a form of Grothendieck construction to create an ordered partial monoid that brings together the global data of the family in a single structure. We apply our approach to database theory and axiomatic structures in approximate reasoning. Thus, ordered partial monoids provide a foundation for the algebraic study for information gathering in its most primitive form