Taishi Kurahashi

Arch. Math. Log., May, 2024

The fixed point and the Craig interpolation properties for sublogics of bfIL.

[BibT_eX]

[DOI]

Sohei Iwata

Yuya Okawa

Arch. Math. Log., February, 2024

2023

Some Observations on the FGH Theorem.

[BibT_eX]

[DOI]

Stud Logica, October, 2023

Arithmetical completeness theorems for monotonic modal logics.

[BibT_eX]

[DOI]

Haruka Kogure

Ann. Pure Appl. Log., July, 2023

Conservation theorems on Semi-Classical Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2023

2022

On Inclusions Between Quantified Provability Logics.

[BibT_eX]

[DOI]

Stud Logica, 2022

Refining the arithmetical hierarchy of classical principles.

[BibT_eX]

[DOI]

Math. Log. Q., 2022

On Guaspari's problem about partially conservative sentences.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2022

2021

Modal completeness of sublogics of the interpretability logic IL.

[BibT_eX]

[DOI]

Yuya Okawa

Math. Log. Q., 2021

Topological semantics of conservativity and interpretability logics.

[BibT_eX]

[DOI]

Sohei Iwata

J. Log. Comput., 2021

Prenex Normal Form theorems in Semi-Classical Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2021

2020

Rosser Provability and Normal Modal Logics.

[BibT_eX]

[DOI]

Stud Logica, 2020

A note on Derivability conditions.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

Uniform Lyndon interpolation property in propositional modal logics.

[BibT_eX]

[DOI]

Arch. Math. Log., 2020

2019

On arithmetical completeness of the logic of proofs.

[BibT_eX]

[DOI]

Sohei Iwata

Ann. Pure Appl. Log., 2019

2018

Arithmetical Soundness and Completeness for $$\varvec{\Sigma }_{\varvec{2}}$$ Σ 2 Numerations.

[BibT_eX]

[DOI]

Stud Logica, 2018

Arithmetical Completeness Theorem for Modal Logic K.

[BibT_eX]

[DOI]

Stud Logica, 2018

Provability Logics Relative to a fixed Extension of Peano Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

On partial disjunction properties of theories containing Peano arithmetic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2018

2017

Generalizations of Gödel's Incompleteness theorems for ∑ n -Definable Theories of Arithmetic.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2017

Universal Rosser Predicates.

[BibT_eX]

[DOI]

J. Symb. Log., 2017

2016

Illusory Models of Peano Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2016

Liar-type Paradoxes and the Incompleteness Phenomena.

[BibT_eX]

[DOI]

J. Philos. Log., 2016

Henkin sentences and local reflection principles for Rosser provability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2014

Rosser-Type Undecidable Sentences Based on Yablo's Paradox.

[BibT_eX]

[DOI]

J. Philos. Log., 2014

2013

Arithmetical Interpretations and Kripke Frames of Predicate Modal Logic of Provability.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2013

On predicate provability logics and binumerations of fragments of Peano arithmetic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2013

2012

On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos.

[BibT_eX]

[DOI]