Representing any-time and program-iteration by infinitary conjunction

DOI10.1080/11663081.2013.830402zbMath1398.03094OpenAlexW2036991276MaRDI QIDQ4583319

Norihiro Kamide

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2013.830402

zbMATH Keywords

completeness theoremcut-elimination theoreminfinitary conjunctionany-time operatorprior's tense logicprogram-iteration operator

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Other infinitary logic (03C75)

Cites Work

• Combining linear-time temporal logic with constructiveness and paraconsistency
• Modality, bisimulation and interpolation in infinitary logic
• Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
• Proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representing any-time and program-iteration by infinitary conjunction