Results 201 to 210 of about 10,336 (231)
Some of the next articles are maybe not open access.
Minimal resolution proof systems for finitely-valued Lukasiewicz logics
[1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic, 2002An effective method for constructing minimal (in the sense described in this study) nonclausal resolution proof systems for Lukasiewicz logics is described. It is shown that every minimal resolution counterpart of the n-valued Lukasiewicz logic, n>2, has 2n verifiers, and a polynomial time algorithm to generate them is provided. >
E. R. Harley, Zbigniew Stachniak
openaire +1 more source
FINITE-VALUED CONTROL LAW SYNTHESIS FOR NONLINEAR UNCERTAIN SYSTEMS
IFAC Proceedings Volumes, 2002Abstract In this paper a Lyapunov technique is presented for the synthesis of controllers characterised by control signals that, for construction simplicity and/or in order to attain a better efficiency, may only assume a finite number of values.
CELENTANO, GIOVANNI, IERVOLINO, RAFFAELE
openaire +4 more sources
History and Philosophy of Logic, 2021
The article explores the following question: which among the most often examined in the literature method of constructing Hilbert-type axiom systems for finite-valued propositional logics of Łukasi...
openaire +1 more source
The article explores the following question: which among the most often examined in the literature method of constructing Hilbert-type axiom systems for finite-valued propositional logics of Łukasi...
openaire +1 more source
Calculation of point-spread function for optical systems with finite value of numerical aperture
Optik, 2007The scalar theory is described for calculation of the point-spread function (PSF) of optical systems with a large numerical aperture. In our work, we introduced an analytic description of this phenomenon and we derived exact and simple approximate relations that enable to calculate the PSF for a diffraction-limited optical system with a finite value of
Antonin Miks, Jiri Novak, Pavel Novak
openaire +1 more source
Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics
2012A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values.
Marco Volpe 0001 +2 more
openaire +1 more source
On Finitely-Valued Inference Systems
Studia Logica, 1998In this paper the author looks for a proof-theoretical evidence of finite-valuedness within the class of cumulative inference systems. The notion of an inferentially many-valued inference system is defined and investigated. This definition tries to capture the idea of the proof-theoretical representation of truth-functional many-valued semantics.
openaire +1 more source
1990
Qiantum Systems subjected to finite BC are valuable in several fields of Chemistry and Physics. Thus, a large number of phenomena require the use of bounded quantum models in order to rationalize them in a natural manner.
G. A. Arteca +2 more
openaire +1 more source
Qiantum Systems subjected to finite BC are valuable in several fields of Chemistry and Physics. Thus, a large number of phenomena require the use of bounded quantum models in order to rationalize them in a natural manner.
G. A. Arteca +2 more
openaire +1 more source
Hypothesis Testing and State Estimation for Discrete Systems with Finite-Valued Switching Parameters
1977Abstract : This paper considers the problem of state estimation for discrete systems with parameters which may be switching within a finite set of values. In the general case it is shown that the optimal estimator requires a bank of elemental estimators with its number growing exponentially with time. For the Markov parameter case, it is found that the
M. Athans, C. B. Chang
openaire +1 more source
Ukrainian Mathematical Journal, 1998
Stochastic processes satisfying the stochastic differential equations \[ \begin{aligned} dx(t) &= A(t,\zeta (t))x(t)dt+B(t,\zeta (t))dW(t),\quad t\geq 0,\\ dy(t) &= H(t,\zeta (t))x(t)dt+G(t,\zeta (t))dV(t),\quad t\geq 0,\end{aligned} \] are considered. In these equations \(\zeta (t)\) is a Markov process with a finite number of states, \(W(t)\) and \(V(
openaire +1 more source
Stochastic processes satisfying the stochastic differential equations \[ \begin{aligned} dx(t) &= A(t,\zeta (t))x(t)dt+B(t,\zeta (t))dW(t),\quad t\geq 0,\\ dy(t) &= H(t,\zeta (t))x(t)dt+G(t,\zeta (t))dV(t),\quad t\geq 0,\end{aligned} \] are considered. In these equations \(\zeta (t)\) is a Markov process with a finite number of states, \(W(t)\) and \(V(
openaire +1 more source
Sequent-type rejection systems for finite-valued non-deterministic logics
Journal of Applied Non-Classical Logics, 2023Martin Gius, Hans Tompits
openaire +1 more source