Related papers: Classical Mereology is Axiomatizable Using Primiti…
Mereology in its formal guise is usually couched in a language whose signature contains only one primitive binary predicate symbol representing the part of relation, either the proper or improper one. In this paper, we put forward an…
Atomism is the view that everything is composed of atoms. The view within the framework of the contemporary formal approach is expressed on the ground of mereology with the use of the primitive notion of being a part as every object has at…
Stanis{\l}aw Le\'sniewski's mereology was formulated in a specific way, deviating from standard formalizations. Nowadays, Le\'sniewski's theory is presented in the form of an elementary theory or translated into the language of the theory…
We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…
During the last decade, the domain of Qualitative Spatial Reasoning, has known a renewal of interest for mereogeometry, a theory that has been initiated by Tarski. Mereogeometry relies on mereology, the Lesniewski's theory of parts and…
Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…
The aim of this paper is to give mathematical account of an argument of David Lewis in Parts of Classes in defense of universalism in mereology. Specifically we study how to extend models of Core Mereology (following Achille Varzi's…
This paper introduces a new theory which encompasses concepts and ideas from set theory, type theory, and Le\'{s}niewski's mereology and describes its possibility as an alternative foundation for mathematics. In the introduction section I…
Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…
Riemann sums, a classical method for approximating the definite integral of a function, have been extensively studied in the past. However, their monotonic properties, while still of great importance, particularly in approximation theory…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…
The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature. Lifting this result to a weighted setting has been widely studied.…
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…
Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…
The authors propose a robust semi-parametric empirical likelihood method to integrate all available information from multiple samples with a common center of measurements. Two different sets of estimating equations are used to improve the…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…