English
Related papers

Related papers: Paraconsistentization and many-valued logics

200 papers

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Symbolic Computation · Computer Science 2010-05-17 Changbo Chen , James H. Davenport , John P. May , Marc Moreno Maza , Bican Xia , Rong Xiao

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

We develop and generalize the theory of extreme value for non-stationary stochastic processes, mostly by weakening the uniform mixing condition that was previously used in this setting. We apply our results to non-autonomous dynamical…

Dynamical Systems · Mathematics 2017-06-27 Ana Cristina Moreira Freitas , Jorge Milhazes Freitas , Sandro Vaienti

The coexistence of infinitely many attractors is called extreme multistability in dynamical systems. In coupled systems, this phenomenon is closely related to partial synchrony and characterized by the emergence of a conserved quantity. We…

Chaotic Dynamics · Physics 2015-06-11 Chittaranjan Hens , Syamal K. Dana , Ulrike Feudel

Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…

Artificial Intelligence · Computer Science 2013-04-15 Marvin S. Cohen

Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…

Quantum Physics · Physics 2013-07-30 Hector Freytes , Graciela Domenech

Straightforward method for the derivation of linearized version of stochastic stability analysis of the nonlinear differential equations is presented. Methods for the study of large time behavior of the moments are exposed. These general…

Mathematical Physics · Physics 2012-12-07 Gyorgy Steinbrecher , Xavier Garbet

We augment LP with a strong conditional operator, to yield a logic we call "strong LP," or LP=>. The resulting logic can speak of consistency in more discriminating ways, but introduces new possibilities for trivializing paradoxes.

Logic · Mathematics 2013-04-25 Nick Thomas

In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation…

Logic in Computer Science · Computer Science 2011-03-07 Zoran Majkic

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Logic in Computer Science · Computer Science 2007-05-23 Sabine Glesner , Karl Stroetmann

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

In this note we consider a class of linear time invariant systems with infinitely many unstable modes. By using the parameterization of all stabilizing controllers and a data transformation, we show that H-infinity controllers for such…

Systems and Control · Electrical Eng. & Systems 2020-03-13 Suat Gumussoy , Hitay Ozbay

Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.

Logic · Mathematics 2015-04-15 Anna Mikhailovich

In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express…

Logic in Computer Science · Computer Science 2018-04-06 Erika Abraham , Borzoo Bonakdarpour

It is known that multiple zeta values can be written in terms of certain iterated log-sine integrals. Conversely, we evaluate iterated log-sine integrals in terms of multiple polylogarithms and multiple zeta values in this paper. We also…

Number Theory · Mathematics 2019-12-17 Ryota Umezawa

System identification of complex and nonlinear systems is a central problem for model predictive control and model-based reinforcement learning. Despite their complexity, such systems can often be approximated well by a set of linear…

Machine Learning · Statistics 2019-05-30 Philip Becker-Ehmck , Jan Peters , Patrick van der Smagt

We study a class of non-linear parabolic systems relevant in turbulence theory. Those systems can be viewed as simplified versions of the Prandtl one-equation and Kolmogorov two-equation models of turbulence. We restrict our attention to…

Analysis of PDEs · Mathematics 2022-08-10 Francesco Fanelli , Rafael Granero-Belinchón

The current article discusses some applications of fuzzy logic to assessment of learning. We consider here a new trapezoidal fuzzy model for learning assessment.

General Mathematics · Mathematics 2014-07-02 Igor Ya. Subbotin

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…

Logic in Computer Science · Computer Science 2021-02-16 G. Antoniou , D. Billington , G. Governatori , M. J. Maher

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic
‹ Prev 1 8 9 10 Next ›