Prior's Ideal Language

Patrick Rowan Blackburn; Torben Braüner; Julie Lundbak Kofod

doi:10.1017/S0960129525000076

Prior's Ideal Language

Patrick Rowan Blackburn
, Torben Braüner^*
, Julie Lundbak Kofod

^*Corresponding author

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review

3 Citationer (Scopus)

Abstract

We present an axiom system for what we call Prior's Ideal Language and prove its completeness and pure completeness with respect to general models. With this is done, we explain, with examples, why this system provides a useful setting for exploring Arthur Prior's work.

Originalsprog	Engelsk
Artikelnummer	e7
Tidsskrift	Mathematical Structures in Computer Science
Vol/bind	35
Antal sider	19
ISSN	0960-1295
DOI	https://doi.org/10.1017/S0960129525000076
Status	Udgivet - 8 apr. 2025

Adgang til dokumentet

10.1017/S0960129525000076

Citationsformater

@article{fea93ff7f8d047c8b58dfda3533c7365,

title = "Prior's Ideal Language",

abstract = "We present an axiom system for what we call Prior's Ideal Language and prove its completeness and pure completeness with respect to general models. With this is done, we explain, with examples, why this system provides a useful setting for exploring Arthur Prior's work.",

keywords = "Arthur Prior, modal logic, hybrid logic, propositional quantifiers, universal modality, downarrow, Henkin semantics, general models, tense logic, description logic",

author = "Blackburn, \{Patrick Rowan\} and Torben Bra{\"u}ner and Kofod, \{Julie Lundbak\}",

year = "2025",

month = apr,

day = "8",

doi = "10.1017/S0960129525000076",

language = "English",

volume = "35",

journal = "Mathematical Structures in Computer Science",

issn = "0960-1295",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - Prior's Ideal Language

AU - Blackburn, Patrick Rowan

AU - Braüner, Torben

AU - Kofod, Julie Lundbak

PY - 2025/4/8

Y1 - 2025/4/8

N2 - We present an axiom system for what we call Prior's Ideal Language and prove its completeness and pure completeness with respect to general models. With this is done, we explain, with examples, why this system provides a useful setting for exploring Arthur Prior's work.

AB - We present an axiom system for what we call Prior's Ideal Language and prove its completeness and pure completeness with respect to general models. With this is done, we explain, with examples, why this system provides a useful setting for exploring Arthur Prior's work.

KW - Arthur Prior

KW - modal logic

KW - hybrid logic

KW - propositional quantifiers

KW - universal modality

KW - downarrow

KW - Henkin semantics

KW - general models

KW - tense logic

KW - description logic

U2 - 10.1017/S0960129525000076

DO - 10.1017/S0960129525000076

M3 - Journal article

SN - 0960-1295

VL - 35

JO - Mathematical Structures in Computer Science

JF - Mathematical Structures in Computer Science

M1 - e7

ER -