Modal Languages and Bounded Fragments of Predicate Logic

[...]Section 6 presents some further directions.LOGI58.tex; 23/04/1998; 14:59; v.7; p.2MODAL LANGUAGES AND BOUNDED FRAGMENTS OF PREDICATE LOGIC 219This paper is the first public version of a longer projected document whose current working version is Andreka, van Benthem and N emeti 1994A. First-Orde...

Full description

Saved in:
Bibliographic Details
Published in:Journal of philosophical logic 1998-06, Vol.27 (3), p.217-274
Main Authors: Andréka, Hajnal, Németi, István, van Benthem, Johan
Format: Article
Language:English
Subjects:
Algebra
Computer science
Decidability
Dissertations & theses
Induced substructures
Interpolation
Investigations
Language
Logic
Logical theorems
Modal logic
Model theory
Philosophical logics. Philosophy of language
Philosophy
Predicate
Predicate logic
Semantics
Universal algebra
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:[...]Section 6 presents some further directions.LOGI58.tex; 23/04/1998; 14:59; v.7; p.2MODAL LANGUAGES AND BOUNDED FRAGMENTS OF PREDICATE LOGIC 219This paper is the first public version of a longer projected document whose current working version is Andreka, van Benthem and N emeti 1994A. First-Order TranslationConsider the basic propositional modal logic, in the language with Booleans and _ and modalities[squiggleright][squiggleright]. [...]has one free variable x. If M is a first-order model and a is an element of this model, then M[arrowhookleft]a |= says that is true in M when x is evaluated to a. We then say that (M[arrowhookleft]a) is a model for , or that is true in[suppress](M[arrowhookleft]a). [...]we have the usual notion of consequence.[suppress] |= .
ISSN:0022-3611
1573-0433
DOI:10.1023/A:1004275029985