698 research outputs found
First-order Goedel logics
First-order Goedel logics are a family of infinite-valued logics where the
sets of truth values V are closed subsets of [0, 1] containing both 0 and 1.
Different such sets V in general determine different Goedel logics G_V (sets of
those formulas which evaluate to 1 in every interpretation into V). It is shown
that G_V is axiomatizable iff V is finite, V is uncountable with 0 isolated in
V, or every neighborhood of 0 in V is uncountable. Complete axiomatizations for
each of these cases are given. The r.e. prenex, negation-free, and existential
fragments of all first-order Goedel logics are also characterized.Comment: 37 page
The propositional logic of teams
Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team
semantic constructions have been used to generate expressively enriched logics
still conserving nice properties, such as compactness or decidability. In
contrast, these logics fail to be substitutional, limiting any algebraic
treatment, and rendering schematic uniform proof systems impossible. This
shortcoming can be attributed to the flatness principle, commonly adhered to
when generating team semantics. Investigating the formation of team semantics
from algebraic semantics, and disregarding the flatness principle, we present
the logic of teams, LT, a substitutional logic for which important
propositional team logics are axiomatisable as fragments. Starting from
classical propositional logic and Boolean algebras, we give semantics for LT by
considering the algebras that are powersets of Boolean algebras B, equipped
with internal (point-wise) and external (set-theoretic) connectives.
Furthermore, we present a well-motivated complete and sound labelled natural
deduction system for LT.Comment: 28 page
Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer
and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We
give new analytic proof systems for A and use the embeddings to derive
corresponding systems for L. These include: hypersequent calculi for A and L
and terminating versions of these calculi; labelled single sequent calculi for
A and L of complexity co-NP; unlabelled single sequent calculi for A and L.Comment: 35 pages, 1 figur
Valuations in Nilpotent Minimum Logic
The Euler characteristic can be defined as a special kind of valuation on
finite distributive lattices. This work begins with some brief consideration on
the role of the Euler characteristic on NM algebras, the algebraic counterpart
of Nilpotent Minimum logic. Then, we introduce a new valuation, a modified
version of the Euler characteristic we call idempotent Euler characteristic. We
show that the new valuation encodes information about the formul{\ae} in NM
propositional logic
On strongly standard complete fuzzy logics: and its expansions
Finding strongly standard complete axiomatizations for t-norm based fuzzy logics (i.e. complete for deductions with infinite sets of premises w.r.t. semantics on the real unit interval [0, 1]) is still an open problem in general, even though results are already available for some particular cases like some infinitary logics based on a continuous t-norm or certain expansions of Monoidal t-norm based logic (MTL) with rational constant symbols. In this paper we propose a new approach towards the problem of defining strongly standard complete for logics with rational constants in a simpler way. We present a method to obtain a Hilbert-Style axiomatization of the logic associated to an arbitrary standard MTL-algebra expanded with additional connectives whose interpretations on [0, 1] are functions with no jump-type discontinuities.Authors are grateful to anonymous reviewers and acknowledge partial support of the Mineco project TIN2012-39348-C02-01.Peer Reviewe
- …