The Experts below are selected from a list of 15348 Experts worldwide ranked by ideXlab platform
Piotr Kulicki - One of the best experts on this subject based on the ideXlab platform.
-
on deontic action logics based on Boolean Algebra
Journal of Logic and Computation, 2015Co-Authors: Robert Trypuz, Piotr KulickiAbstract:AbstractThe aim of the paper is to provide a metalogical systematisation in thearea of deontic action logic based on Boolean Algebra. Differences amongthe systems involve two aspects: the level of closedness of a deontic actionlogic and the possibility of performing no action at all. It is also shownthat the existing definitions of obligation in these systems are unacceptabledue to their non-intuitive interpretation or paradoxical consequences. As asolution we propose a minimal axiomatic characterisation of obligation withan adequate class of models. The paper also describes how deontic actionlogic can be used to answer the questions from the Polish driving license test.Keywords: deontic action logic, obligation, principle of obligationeconomy, closedness, action theoryIntroductionWithin computer science, logical systems are usually designed with aspecific application in mind. Reusability of those systems depends largelyon their more general comparative analysis and the awareness of their pre-suppositions and consequences. The ready-made system, with well knowncharacteristics and properties, can be then used for new applications. Forthis reason we provide a metalogical systematisation in the area of deonticaction logic based on Boolean Algebra.A Deontic Logic of Action [19], an article published by K. Segerberg in1982 was a milestone in the development of the logic in question since the1950s, when G. H. von Wright [26] and J. Kalinowski [10], published their
-
towards metalogical systematisation of deontic action logics based on Boolean Algebra
Deontic Logic in Computer Science, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean Algebra. Differences among the systems in question lie in two aspects: the level of closedness of a deontic action logic and the possibility of performing no action at all. It is also shown that the existing definitions of obligation in those systems are not acceptable due to their unintuitive interpretation or paradoxical consequences. As a solution we propose an axiomatic characterisation of obligation with an adequate class of models.
-
a systematics of deontic action logics based on Boolean Algebra
Logic and Logical Philosophy, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean Algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean Algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject.
-
DEON - Towards metalogical systematisation of deontic action logics based on Boolean Algebra
Lecture Notes in Computer Science, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean Algebra. Differences among the systems in question lie in two aspects: the level of closedness of a deontic action logic and the possibility of performing no action at all. It is also shown that the existing definitions of obligation in those systems are not acceptable due to their unintuitive interpretation or paradoxical consequences. As a solution we propose an axiomatic characterisation of obligation with an adequate class of models.
Robert Trypuz - One of the best experts on this subject based on the ideXlab platform.
-
on deontic action logics based on Boolean Algebra
Journal of Logic and Computation, 2015Co-Authors: Robert Trypuz, Piotr KulickiAbstract:AbstractThe aim of the paper is to provide a metalogical systematisation in thearea of deontic action logic based on Boolean Algebra. Differences amongthe systems involve two aspects: the level of closedness of a deontic actionlogic and the possibility of performing no action at all. It is also shownthat the existing definitions of obligation in these systems are unacceptabledue to their non-intuitive interpretation or paradoxical consequences. As asolution we propose a minimal axiomatic characterisation of obligation withan adequate class of models. The paper also describes how deontic actionlogic can be used to answer the questions from the Polish driving license test.Keywords: deontic action logic, obligation, principle of obligationeconomy, closedness, action theoryIntroductionWithin computer science, logical systems are usually designed with aspecific application in mind. Reusability of those systems depends largelyon their more general comparative analysis and the awareness of their pre-suppositions and consequences. The ready-made system, with well knowncharacteristics and properties, can be then used for new applications. Forthis reason we provide a metalogical systematisation in the area of deonticaction logic based on Boolean Algebra.A Deontic Logic of Action [19], an article published by K. Segerberg in1982 was a milestone in the development of the logic in question since the1950s, when G. H. von Wright [26] and J. Kalinowski [10], published their
-
towards metalogical systematisation of deontic action logics based on Boolean Algebra
Deontic Logic in Computer Science, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean Algebra. Differences among the systems in question lie in two aspects: the level of closedness of a deontic action logic and the possibility of performing no action at all. It is also shown that the existing definitions of obligation in those systems are not acceptable due to their unintuitive interpretation or paradoxical consequences. As a solution we propose an axiomatic characterisation of obligation with an adequate class of models.
-
a systematics of deontic action logics based on Boolean Algebra
Logic and Logical Philosophy, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean Algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean Algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject.
-
DEON - Towards metalogical systematisation of deontic action logics based on Boolean Algebra
Lecture Notes in Computer Science, 2010Co-Authors: Robert Trypuz, Piotr KulickiAbstract:The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean Algebra. Differences among the systems in question lie in two aspects: the level of closedness of a deontic action logic and the possibility of performing no action at all. It is also shown that the existing definitions of obligation in those systems are not acceptable due to their unintuitive interpretation or paradoxical consequences. As a solution we propose an axiomatic characterisation of obligation with an adequate class of models.
Boris Tsirelson - One of the best experts on this subject based on the ideXlab platform.
-
Noise as a Boolean Algebra of $\sigma$-fields
The Annals of Probability, 2014Co-Authors: Boris TsirelsonAbstract:A noise is a kind of homomorphism from a Boolean Algebra of domains to the lattice of $\sigma$-fields. Leaving aside the homomorphism we examine its image, a Boolean Algebra of $\sigma$-fields. The largest extension of such Boolean Algebra of $\sigma$-fields, being well-defined always, is a complete Boolean Algebra if and only if the noise is classical, which answers an old question of J. Feldman.
-
noise as a Boolean Algebra of sigma fields ii classicality blackness spectrum
arXiv: Probability, 2011Co-Authors: Boris TsirelsonAbstract:Similarly to noises, Boolean Algebras of sigma-fields can be black. A noise may be treated as a homomorphism from a Boolean Algebra of regular open sets to a Boolean Algebra of sigma-fields. Spectral sets are useful also in this framework.
Changzhe Chen - One of the best experts on this subject based on the ideXlab platform.
-
design of vector controller of pmsm based on pan Boolean Algebra self adapting pid control
International Conference on Mechatronics and Automation, 2009Co-Authors: Changzhe ChenAbstract:A vector control strategy of PMSM based on Pan-Boolean Algebra self-adapting PID control is proposed in this paper, which is unnecessary to set up the exact mathematical model of the controlled plant. According to the deviation and deviation rate at different time, it is able to eliminate the influences of the parameters of the controlled plant and the disturbance of the external environment by online adjusting the parameters of the PID controller. For the PMSM speed adjustment system, the PI controller is used in current loop and Pan-Boolean Algebra self-adjusting PID controller is used in speed loop instead of traditional PI controller. The effectiveness of the proposed control method is verified by simulation based on Matlab and implemented using experimental platform based on DSP chip. The simulation and experimental results show that the performance and robustness of the controller are better than the conventional PI controller in the PMSM control system.
Liu Wei-fen - One of the best experts on this subject based on the ideXlab platform.
-
FP-soft Boolean Algebra
Mathematics in Practice and Theory, 2015Co-Authors: Liu Wei-fenAbstract:By combining FP-soft set to Boolean Algebra,The concepts of FP-soft Boolean Algebra,FP-soft Boolean subAlgebra,FP-soft ideal of FP-soft Boolean Algebra and FP-idealistic soft Boolean Algebra are defined and some related properties are discussed.Lastly,homomorphism between FP-soft Boolean Algebra is investigated.
-
Soft Boolean Algebra
Journal of Shandong University, 2013Co-Authors: Liu Wei-fenAbstract:The soft set theory is applied to the Boolean Algebra.The concepts of soft Boolean Algebra,soft Boolean subAlgebra,soft ideal of soft Boolean Algebra and idealistic soft Boolean Algebra are presented and some related Algebraic properties are discussed.The relations between soft Boolean Algebra and several kinds of fuzzy subAlgebras of Boolean Algebra are preliminarily investigated.