Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Effectively constructible fixed points in Sacchetti's modal logics of provability (1811.12827v2)

Published 30 Nov 2018 in math.LO

Abstract: We give a purely syntactical proof of the fixed point theorem for Sacchetti's modal logics ${\bf K} + \Box(\Boxn p \to p) \to \Box p$ ($n \geq 2$) of provability. From our proof, an effective procedure for constructing fixed points in these logics is obtained. We also show the existence of simple fixed points for particular modal formulas.

Summary

We haven't generated a summary for this paper yet.