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.

Authors

Institutions

Publication Details

Journal
Mathematical Structures in Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1017/s0960129525000076
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prior’s ideal language

Julie Lundbak Kofod, Patrick Blackburn, Torben Braüner
Mathematical Structures in Computer Science
Logic, Reasoning, and Knowledge
article

Prior’s ideal language

Julie Lundbak Kofod, Patrick Blackburn, Torben Braüner
article en

Abstract

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.

Mathematical Structures in Computer ScienceVol. 35
Roskilde University (DK)
Openalex Percentile: Top 97%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Prior’s ideal language — Julie Lundbak Kofod, Patrick Blackburn, et al. · Mathematical Structures in Computer Science (2025) | TGRS Research Map | TGRS