Results 231 to 240 of about 10,791,571 (264)

Two-dimensional billiards are Turing complete. [PDF]

open access: yesProc Natl Acad Sci U S A
Miranda E, Ramos I.
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Minimal resolution proof systems for finitely-valued Lukasiewicz logics

[1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic, 2002
An 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, 2002
Abstract 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

On the Methods of Constructing Hilbert-type Axiom Systems for Finite-valued Propositional Logics of Łukasiewicz

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

Calculation of point-spread function for optical systems with finite value of numerical aperture

Optik, 2007
The 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

2012
A 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, 1998
In 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

Home - About - Disclaimer - Privacy