English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Boolean Algebras with Functions - Correspondence, Completeness and Quantifier Elimination

Ohlbach, H. J. (1995). Boolean Algebras with Functions - Correspondence, Completeness and Quantifier Elimination.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ohlbach, Hans Jürgen1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as propositional extension of standard propositional logic can be transformed and simplified using syntactic methods, in particular quantifier elimination algorithms for second--order predicate logic. This enables us to exploit representation theorems and model theoretic semantics for these algebras and logics in such a way that for special instances of these systems, i.e. particular algebras and particular logics the corresponding specializations on the semantic side can be computed automatically. Special cases of the results of this paper are the theorem proving aspects of J{\'o}nsson and Traski's representation theorem for Boolean Algebras with operators, completeness of different possible worlds semantics for modal logics and a clarification of the correlation between correspondence and completeness in modal logics.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519526
Other: Local-ID: C1256104005ECAFC-5D009C38CF9EDC24C125615B005D0C78-Ohlbach95b
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show