DS-1995-12: Taming Logics

DS-1995-12: Mikulás, Szabolcs (1995) Taming Logics. Doctoral thesis, University of Amsterdam.

[thumbnail of Full Text (PDF)] Text (Full Text (PDF))
DS-1995-12-Szabolcs-Mikulas.text.pdf - Published Version

Download (9MB)
[thumbnail of Full Text (DJVU)] Image (Full Text (DJVU))

Download (4MB)
[thumbnail of Samenvatting] Text (Samenvatting)
DS-1995-12-Szabolcs-Mikulas.samenvatting.txt - Other

Download (3kB)


Taming amounts to finding computationally well-behaved versions of logics
and classes of algebras. The main concern of the dissertation is to find
decidable and complete versions of arrow logic and predicate logic. These
results are achieved by proving the equivalent decidability and finite
axiomatizability theorems for the corresponding classes of binary and
higher-order relations.

The connections between logics and algebras are explained in an
introductory chapter. One chapter deals with reducts of arrow logic (e.g.
Lambek calculus), another with arrow logics with extended similarity types
(difference operator, graded modalities). The last chapter provides
sufficient and necessary conditions for representability of relation and
cylindric algebras, which yield completeness results for arrow logics and
first-order logics.

Item Type: Thesis (Doctoral)
Report Nr: DS-1995-12
Series Name: ILLC Dissertation (DS) Series
Year: 1995
Subjects: Computation
Depositing User: Dr Marco Vervoort
Date Deposited: 14 Jun 2022 15:16
Last Modified: 05 Oct 2023 14:15
URI: https://eprints.illc.uva.nl/id/eprint/1985

Actions (login required)

View Item View Item