97 research outputs found
Zero-one laws with respect to models of provability logic and two Grzegorczyk logics
It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5 and for frames corresponding to S4 and S5. In this paper, we prove zero-one laws for provability logic and its two siblings Grzegorczyk logic and weak Grzegorczyk logic, with respect to model validity. Moreover, we axiomatize validity in almost all relevant finite models, leading to three different axiom systems
Paraconsistência em lógica híbrida
Mestrado em Matemática e AplicaçõesThe use of hybrid logics allows the description of relational structures, at the
same time that allows establishing accessibility relations between states and,
furthermore, nominating and making mention to what happens at speci c
states.
However, the information we collect is subject to inconsistencies, namely,
the search for di erent information sources can lead us to pick up contradictions.
Nowadays, by having so many means of dissemination available,
that happens frequently.
The aim of this work is to develop tools capable of dealing with contradictory
information that can be described as hybrid logics' formulas. To build
models, to compare inconsistency in di erent databases, and to see the applicability
of this method in day-to-day life are the basis for the development
of this dissertation.O uso de lógicas híbridas permite a descrição de estruturas relacionais, ao mesmo tempo que permite estabelecer relações de acessibilidade entre
estados, e, para além disso, nomear e fazer referência ao que acontece em
estados específicos.
No entanto, a informação que recolhemos está sujeita a inconsistências,
isto é, a procura de diferentes fontes de informação pode levar a recolha
de contradições. O que nos dias de hoje, com tantos meios de divulgação
disponíveis, acontece frequentemente.
O objetivo deste trabalho e desenvolver ferramentas capazes de lidar com informação contraditória que possa ser descrita através de fórmulas de lógicas
híbridas. Construir modelos e comparar a inconsistência de diferentes bases
de dados e ver a aplicabilidade deste método no dia-a-dia são a base para
o desenvolvimento desta dissertação
05171 Abstracts Collection -- Nonmonotonic Reasoning, Answer Set Programming and Constraints
From 24.04.05 to 29.04.05, the Dagstuhl Seminar
05171 ``Nonmonotonic Reasoning, Answer Set Programming and Constraints\u27\u27
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
FDE Circumscription
In his article "Reassurance via Translation" Marcel Crabbe proposed a formalism to obtain reassurance and classical recapture in the setting of minimal FDE. His formalism proved to be general enough to be extended in order to formalize other forms of non-monotonic systems based on preference relations. It is the aim of this article to show how his result can be extended in a natural way by combining two different reasoning systems, namely minimal FDE and circumscription, in order to get a paraconsistent and paracomplete version of circumscription, which we will call paracomplistent circumscription, which has the advantages of FDE and circumscription but is neither explosive nor lacks modus ponens in consistent contexts. Furthermore, we will complete a proof Crabbe left unfinished
Neutrality and Many-Valued Logics
In this book, we consider various many-valued logics: standard, linear,
hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We
survey also results which show the tree different proof-theoretic frameworks
for many-valued logics, e.g. frameworks of the following deductive calculi:
Hilbert's style, sequent, and hypersequent. We present a general way that
allows to construct systematically analytic calculi for a large family of
non-Archimedean many-valued logics: hyperrational-valued, hyperreal-valued, and
p-adic valued logics characterized by a special format of semantics with an
appropriate rejection of Archimedes' axiom. These logics are built as different
extensions of standard many-valued logics (namely, Lukasiewicz's, Goedel's,
Product, and Post's logics). The informal sense of Archimedes' axiom is that
anything can be measured by a ruler. Also logical multiple-validity without
Archimedes' axiom consists in that the set of truth values is infinite and it
is not well-founded and well-ordered. On the base of non-Archimedean valued
logics, we construct non-Archimedean valued interval neutrosophic logic INL by
which we can describe neutrality phenomena.Comment: 119 page
- …