相关论文: Some model-theoretic results on the 3-valued parac…
Apparently, all partial differential equations that describe physical phenomena in space-time can be cast into a universal quasilinear, first-order form. In this paper, we do two things. First, we describe some broad features of systems of…
Convincing someone of the truth value of a premise requires understanding and articulating the core logical structure of the argument which proves or disproves the premise. Understanding the logical structure of an argument refers to…
We introduce the concept of a prenormed model of a particular kind of finitary single-sorted first-order theories, interpreted over a category with finite products. These are referred to as prealgebraic theories, for the fact that their…
Previous works by Gor\'e, Postniece and Tiu have provided sound and cut-free complete proof systems for modal logics extended with path axioms using the formalism of nested sequent. Our aim is to provide (i) a constructive cut-elimination…
In 1967 the author introduced a pre-ordering of all first order complete theories where T is lower than U if it is easier for an ultrapower of a model of T than an ultrapower of a model of U to be saturated. In a long series of recent…
In his quest to disprove a claim by Peirce that all lattices are distributive, Ernst Schr\"oder considered 135 years ago a list of 990 equational laws on quasigroups, analogous to associativity, such as $(x // y) * z = (y // x)…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
Quasi-conformal actions were introduced in the physics literature as a generalization of the familiar fractional linear action on the upper half plane, to Hermitian symmetric tube domains based on arbitrary Jordan algebras, and further to…
In this paper, we reveal some relations between fuzzy logic and quantum logic, and mainly study the partial residuated implications (PRIs) derived from partial triangular norms (partial t-norms) and partial residuated lattices (PRLs), and…
We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…
Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between $\textbf{mbCcl}$ and $\textbf{Cila}$. In order to overcome this limitation, we…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
Multialgebras (or hyperalgebras, or non-deterministic algebras) have been very much studied in Mathematics and in Computer Science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic…
Distributed representations (such as those based on embeddings) and discrete representations (such as those based on logic) have complementary strengths. We explore one possible approach to combining these two kinds of representations. We…
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
In most classical models of belief change, epistemic states are represented by theories (AGM) or formulas (Katsuno-Mendelzon) and the new pieces of information by formulas. The Representation Theorem for revision operators says that…
We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…