Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Hirohiko Kushida"'
Autor:
Robert M. Haralick, Hirohiko Kushida
Publikováno v:
Progress in Artificial Intelligence. 10:375-389
In this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, we will offer our general framework for CSPs, and then apply it to first-order logic. We claim it would function as a n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af18bb0356956866e121363c2fc3c390
https://doi.org/10.1007/s13748-021-00240-8
https://doi.org/10.1007/s13748-021-00240-8
Autor:
Hirohiko Kushida
Publikováno v:
Journal of Logic and Computation. 31:168-178
Artemov (2019, The provability of consistency) offered the notion of constructive truth and falsity of arithmetical sentences in the spirit of Brouwer–Heyting–Kolmogorov semantics and its formalization, the logic of proofs. In this paper, we prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e2bb01a80a63c32b5e78938a3144fa5
https://doi.org/10.1093/logcom/exaa075
https://doi.org/10.1093/logcom/exaa075
Autor:
Hirohiko Kushida, Hidenori Kurokawa
Publikováno v:
Journal of Logic and Computation. 30:295-319
In this paper, we introduce a new logic that we call ‘resource sharing linear logic (RSLL)’. In linear logic (LL), formulas without modality express some resource-conscious situation (a formula can be used only once); formulas with modality expre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8907f0945a0d736c46d72a4440a5622
https://doi.org/10.1093/logcom/exaa013
https://doi.org/10.1093/logcom/exaa013
Autor:
Hirohiko Kushida
Publikováno v:
Studia Logica. 108:857-875
In a classical 1976 paper, Solovay proved the arithmetical completeness of the modal logic GL; provability of a formula in GL coincides with provability of its arithmetical interpretations of it in Peano Arithmetic. In that paper, he also provided an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::151aeffea674567e2d01a0ddba29163b
https://doi.org/10.1007/s11225-019-09891-0
https://doi.org/10.1007/s11225-019-09891-0
Autor:
Hirohiko Kushida
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783030367541
LFCS
LFCS
Recently, Artemov [4] offered the notion of constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs. In this paper, we provide a complete description of constructive truth and fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7da771ee9b85e366649ab48321850883
https://doi.org/10.1007/978-3-030-36755-8_5
https://doi.org/10.1007/978-3-030-36755-8_5
Autor:
Hirohiko Kushida
Publikováno v:
Journal of Philosophical Logic. 39:577-590
The modal logic of Godel sentences, termed as GS, is introduced to analyze the logical properties of ‘true but unprovable’ sentences in formal arithmetic. The logic GS is, in a sense, dual to Grzegorczyk’s Logic, where modality can be interpret
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63340dec19118a9c31d15699f8ea506d
https://doi.org/10.1007/s10992-010-9140-8
https://doi.org/10.1007/s10992-010-9140-8
Autor:
Hirohiko Kushida, Hidenori Kurokawa
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783642399916
WoLLIC
WoLLIC
In this paper, we introduce substructural variants of Artemov's logic of proofs. We show a few things here. First, we introduce a bimodal logic that has both the exponential operator in linear logic and an S4 modal operator which does not bring in an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa2773eee2c9d2b199cf3f0a07fdfbd
https://doi.org/10.1007/978-3-642-39992-3_18
https://doi.org/10.1007/978-3-642-39992-3_18
Autor:
Hirohiko Kushida, Mitsu Okada
Publikováno v:
J. Symbolic Logic 68, iss. 4 (2003), 1403-1414
It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg [10] proved this fact in a syntactic way. Mints [7] extended this result to the quantified
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c347b814ef6b8c2eb67090050a160fb5
http://projecteuclid.org/euclid.jsl/1067620195
http://projecteuclid.org/euclid.jsl/1067620195