default search action
Hirokazu Nishimura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1994
- [j19]Hirokazu Nishimura:
Boolean Valued and Stone Algebra Valued Measure Theories. Math. Log. Q. 40: 69-75 (1994) - 1993
- [j18]Hirokazu Nishimura:
On a Duality Between Boolean Valued Analysis and Topological Reduction Theory. Math. Log. Q. 39: 23-32 (1993) - [j17]Hirokazu Nishimura:
A Boolean Transfer Principle from L*-Algebras to AL*-Algebras. Math. Log. Q. 39: 241-250 (1993) - 1991
- [j16]Hirokazu Nishimura:
Boolean Valued Lie Algebras. J. Symb. Log. 56(2): 731-741 (1991) - [j15]Hirokazu Nishimura:
Boolean Valued Dedekind Domains. Math. Log. Q. 37(5-6): 65-76 (1991) - [j14]Hirokazu Nishimura:
Some Boolean Valued Commutative Algebra. Math. Log. Q. 37(23-24): 367-384 (1991) - [j13]Hirokazu Nishimura:
Foundations of Boolean Valued Algebraic Geometry. Math. Log. Q. 37(26-30): 421-438 (1991) - 1990
- [j12]Hirokazu Nishimura:
On the absoluteness of types in boolean valued lattices. Math. Log. Q. 36(3): 241-246 (1990) - [j11]Hirokazu Nishimura:
Some connections between boolean valued analysis and topological reduction theory for C*-algebras. Math. Log. Q. 36(5): 471-479 (1990) - 1983
- [j10]Hirokazu Nishimura:
Hauptsatz for Higher-Order Modal Logic. J. Symb. Log. 48(3): 744-751 (1983) - 1981
- [j9]Hirokazu Nishimura:
The Semantical Characterization of de Dicto in Continuous Modal Model Theory. Math. Log. Q. 27(15): 233-240 (1981) - 1980
- [j8]Hirokazu Nishimura:
Descriptively Complete Process Logic. Acta Informatica 14: 359-369 (1980) - [j7]Hirokazu Nishimura:
Sequential Method in Quantum Logic. J. Symb. Log. 45(2): 339-352 (1980) - [j6]Hirokazu Nishimura:
A Preservation Theorem for Tense Logic. Math. Log. Q. 26(19-21): 331-335 (1980) - [j5]Hirokazu Nishimura:
Saturated and Special Models in Modal Model Theory With Applications to the Modal and DE RE Hierarchies. Math. Log. Q. 26(31): 481-490 (1980) - 1979
- [j4]Hirokazu Nishimura:
Sequential Method in Propositional Dynamic Logic. Acta Informatica 12: 377-400 (1979) - [j3]Hirokazu Nishimura:
Is the semantics of branching structures adequate for chronological modal logics? J. Philos. Log. 8(1): 469-475 (1979) - [j2]Hirokazu Nishimura:
Is the semantics of branching structures adequate for non-metric Ockhamist tense logics? J. Philos. Log. 8(1): 477-478 (1979) - [j1]Hirokazu Nishimura:
On the Completeness of Chronological Logics with Modal Operators. Math. Log. Q. 25(31): 487-496 (1979)
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-04-25 05:43 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: