default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaishi Kurahashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Sohei Iwata, Taishi Kurahashi
, Yuya Okawa:
The fixed point and the Craig interpolation properties for sublogics of bfIL. Arch. Math. Log. 63(1-2): 1-37 (2024)- [j30]Makoto Fujiwara, Taishi Kurahashi:
Prenex normalization and the hierarchical classification of formulas. Arch. Math. Log. 63(3-4): 391-403 (2024) - [j29]Taishi Kurahashi:
The provability logic of all provability predicates. J. Log. Comput. 34(6): 1108-1135 (2024) - [j28]Sohei Iwata, Taishi Kurahashi, Yuya Okawa:
The persistence principle over weak interpretability logic. Math. Log. Q. 70(1): 37-63 (2024) - [j27]Taishi Kurahashi, Motoki Okuda:
Disjunction and existence Properties in Modal Arithmetic. Rev. Symb. Log. 17(1): 178-205 (2024) - 2023
- [j26]Haruka Kogure, Taishi Kurahashi:
Arithmetical completeness theorems for monotonic modal logics. Ann. Pure Appl. Log. 174(7): 103271 (2023) - [j25]Makoto Fujiwara, Taishi Kurahashi:
Conservation theorems on Semi-Classical Arithmetic. J. Symb. Log. 88(4): 1469-1496 (2023) - [j24]Taishi Kurahashi:
Some Observations on the FGH Theorem. Stud Logica 111(5): 749-778 (2023) - 2022
- [j23]Taishi Kurahashi, Yuya Okawa, V. Yu. Shavrukov, Albert Visser:
On Guaspari's problem about partially conservative sentences. Ann. Pure Appl. Log. 173(5): 103087 (2022) - [j22]Makoto Fujiwara, Taishi Kurahashi:
Refining the arithmetical hierarchy of classical principles. Math. Log. Q. 68(3): 318-345 (2022) - [j21]Taishi Kurahashi:
On Inclusions Between Quantified Provability Logics. Stud Logica 110(1): 165-188 (2022) - 2021
- [j20]Makoto Fujiwara, Taishi Kurahashi:
Prenex Normal Form theorems in Semi-Classical Arithmetic. J. Symb. Log. 86(3): 1124-1153 (2021) - [j19]Sohei Iwata, Taishi Kurahashi:
Topological semantics of conservativity and interpretability logics. J. Log. Comput. 31(7): 1716-1739 (2021) - [j18]Taishi Kurahashi, Yuya Okawa:
Modal completeness of sublogics of the interpretability logic IL. Math. Log. Q. 67(2): 164-185 (2021) - 2020
- [j17]Taishi Kurahashi:
Uniform Lyndon interpolation property in propositional modal logics. Arch. Math. Log. 59(5-6): 659-678 (2020) - [j16]Taishi Kurahashi:
A note on Derivability conditions. J. Symb. Log. 85(3): 1224-1253 (2020) - [j15]Taishi Kurahashi:
Rosser Provability and Normal Modal Logics. Stud Logica 108(3): 597-617 (2020)
2010 – 2019
- 2019
- [j14]Sohei Iwata, Taishi Kurahashi:
On arithmetical completeness of the logic of proofs. Ann. Pure Appl. Log. 170(2): 163-179 (2019) - 2018
- [j13]Taishi Kurahashi:
On partial disjunction properties of theories containing Peano arithmetic. Arch. Math. Log. 57(7-8): 953-980 (2018) - [j12]Taishi Kurahashi:
Provability Logics Relative to a fixed Extension of Peano Arithmetic. J. Symb. Log. 83(3): 1229-1246 (2018) - [j11]Taishi Kurahashi:
Arithmetical Completeness Theorem for Modal Logic K. Stud Logica 106(2): 219-235 (2018) - [j10]Taishi Kurahashi:
Arithmetical Soundness and Completeness for $$\varvec{\Sigma }_{\varvec{2}}$$ Σ 2 Numerations. Stud Logica 106(6): 1181-1196 (2018) - 2017
- [j9]Makoto Kikuchi, Taishi Kurahashi:
Universal Rosser Predicates. J. Symb. Log. 82(1): 292-302 (2017) - [j8]Makoto Kikuchi, Taishi Kurahashi:
Generalizations of Gödel's Incompleteness theorems for ∑ n -Definable Theories of Arithmetic. Rev. Symb. Log. 10(4): 603-616 (2017) - 2016
- [j7]Taishi Kurahashi:
Henkin sentences and local reflection principles for Rosser provability. Ann. Pure Appl. Log. 167(2): 73-94 (2016) - [j6]Makoto Kikuchi, Taishi Kurahashi:
Liar-type Paradoxes and the Incompleteness Phenomena. J. Philos. Log. 45(4): 381-398 (2016) - [j5]Makoto Kikuchi, Taishi Kurahashi:
Illusory Models of Peano Arithmetic. J. Symb. Log. 81(3): 1163-1175 (2016) - 2014
- [j4]Taishi Kurahashi:
Rosser-Type Undecidable Sentences Based on Yablo's Paradox. J. Philos. Log. 43(5): 999-1017 (2014) - 2013
- [j3]Taishi Kurahashi:
On predicate provability logics and binumerations of fragments of Peano arithmetic. Arch. Math. Log. 52(7-8): 871-880 (2013) - [j2]Taishi Kurahashi:
Arithmetical Interpretations and Kripke Frames of Predicate Modal Logic of Provability. Rev. Symb. Log. 6(1): 129-146 (2013) - 2012
- [j1]Makoto Kikuchi, Taishi Kurahashi, Hiroshi Sakai:
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos. Math. Log. Q. 58(4-5): 307-316 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
