Zobrazeno 1 - 10
of 60
pro vyhledávání: '"YASUO KAWAHARA"'
Publikováno v:
Bulletin of informatics and cybernetics. 49:11-34
This paper relationally formulates the axiom of choice and Zorn's lemma. Based on the formalisation, well-known equivalence between the axiom of choice and Zorn's lemma is proved in a manner of relational calculus.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::291e2efda2b6dc17fcac30c23336351a
http://hdl.handle.net/2324/2232319
http://hdl.handle.net/2324/2232319
Publikováno v:
IEICE Transactions on Information and Systems. :588-597
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49588624a9c2cf4850a260ba067511e8
https://doi.org/10.1587/transinf.2015fcp0002
https://doi.org/10.1587/transinf.2015fcp0002
Autor:
Hitoshi Furusawa, Yasuo Kawahara
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 84:359-376
A Dedekind category is a convenient algebraic framework to manipulate (binary) relations. Concepts of points, point axioms and related conditions such as the axiom of totality, the axiom of subobject, the axiom of complement, and the relational axiom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d6d6ac75212354d60887131abeba8f8
https://doi.org/10.1016/j.jlamp.2014.12.003
https://doi.org/10.1016/j.jlamp.2014.12.003
Multirelations provide a semantic domain for computing systems that involve two dual kinds of nondeterminism. This paper presents relational formalisations of Kleisli, Parikh and Peleg compositions and liftings of multirelations. These liftings are s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e87cc93f23506da501645c9d8dd2f744
http://arxiv.org/abs/1705.05650
http://arxiv.org/abs/1705.05650
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 83(2):263-283
The paper proposes two types of convex relations into algebras of probabilistic distributions as a relational algebraic foundation of semantic domains of probabilistic systems [4] , [7] , [8] . Following previous results by Tsumagari [16] , we partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::960469ea267f2982d7b8089a0b2349a7
http://hdl.handle.net/2433/202502
http://hdl.handle.net/2433/202502
Publikováno v:
Bulletin of informatics and cybernetics. 44:111-115
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88cca7b22b2efc87b1f1653f08add394
https://doi.org/10.5109/1495414
https://doi.org/10.5109/1495414
Publikováno v:
Fuzzy Sets and Systems. 173:1-24
Dedekind categories provide a suitable categorical framework for lattice-valued binary relations. It is known that the notion of crispness cannot be described by the basic tools of this theory only. In this paper we will study Dedekind categories wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::329e0bf37619f50cb6304909e672cdd3
https://doi.org/10.1016/j.fss.2010.11.008
https://doi.org/10.1016/j.fss.2010.11.008
Publikováno v:
Bulletin of informatics and cybernetics. 40:101-111
Formal concept analysis is a mathematical field applied to data mining. Usually, a formal concept is defined as a pair of sets, called extents and intents, for a given formal context in binary relation. In this paper we review the idea that Armstrong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0052eea79f2b19d7d24c4a7bbf7658ef
https://doi.org/10.5109/18997
https://doi.org/10.5109/18997
Autor:
Kakuji Tanaka, Yasuo Kawahara
Publikováno v:
Bulletin of informatics and cybernetics. 40:89-99
The concepts of closure systems and closure operations in lattice theory are basic and applied to many fields in mathematics and theoretical computer science. In this paper authors find out a suitable definition of closure systems in Dedekind categor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f670a6928d76480a8f447652a7fdd5e2
http://hdl.handle.net/2324/18996
http://hdl.handle.net/2324/18996
Publikováno v:
Bulletin of informatics and cybernetics. 40:16-50
In this paper we investigate quantum cellular automata whose global transitions are defined using a global transition function of classical cellular automata. And we prove the periodicity of behaviors of some quantum cellular automata.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34ed01d83b0113c68a6b8fa974050aa7
http://hdl.handle.net/2324/18992
http://hdl.handle.net/2324/18992