211 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
Decision Problems for Partial Specifications: Empirical and Worst-Case Complexities
Partial specifications allow approximate models of systems such as Kripke structures, or labeled
transition systems to be created. Using the abstraction possible with these models, an avoidance
of the state-space explosion problem is possible, whilst still retaining a structure that can
have properties checked over it. A single partial specification abstracts a set of systems, whether
Kripke, labeled transition systems, or systems with both atomic propositions and named transitions.
This thesis deals in part with problems arising from a desire to efficiently evaluate
sentences of the modal μ-calculus over a partial specification.
Partial specifications also allow a single system to be modeled by a number of partial specifications,
which abstract away different parts of the system. Alternatively, a number of partial
specifications may represent different requirements on a system. The thesis also addresses the
question of whether a set of partial specifications is consistent, that is to say, whether a single
system exists that is abstracted by each member of the set. The effect of nominals, special
atomic propositions true on only one state in a system, is also considered on the problem of the
consistency of many partial specifications. The thesis also addresses the question of whether
the systems a partial specification abstracts are all abstracted by a second partial specification,
the problem of inclusion.
The thesis demonstrates how commonly used “specification patterns” – useful properties specified
in the modal μ-calculus, can be efficiently evaluated over partial specifications, and gives
upper and lower complexity bounds on the problems related to sets of partial specifications
On some properties of quasi-MV algebras and square root quasi-MV algebras, IV
In the present paper, which is a sequel to
[20, 4, 12], we investigate further the structure theory of quasiMV
algebras and √0quasi-MV algebras. In particular: we provide
a new representation of arbitrary √0qMV algebras in terms
of √0qMV algebras arising out of their MV* term subreducts of
regular elements; we investigate in greater detail the structure
of the lattice of √0qMV varieties, proving that it is uncountable,
providing equational bases for some of its members, as well as
analysing a number of slices of special interest; we show that the
variety of √0qMV algebras has the amalgamation property; we
provide an axiomatisation of the 1-assertional logic of √0qMV
algebras; lastly, we reconsider the correspondence between Cartesian
√0qMV algebras and a category of Abelian lattice-ordered
groups with operators first addressed in [10]
Quantale Modules, with Applications to Logic and Image Processing
We propose a categorical and algebraic study of quantale modules. The results
and constructions presented are also applied to abstract algebraic logic and to
image processing tasks.Comment: 150 pages, 17 figures, 3 tables, Doctoral dissertation, Univ Salern
Fuzzy expert systems in civil engineering
Imperial Users onl
- …