Search results for "Mathematica"
showing 10 items of 7971 documents
The Bishop–Phelps–Bollobás theorem for L(L1(μ),L∞[0,1])
2011
Abstract We show that the Bishop–Phelps–Bollobas theorem holds for all bounded operators from L 1 ( μ ) into L ∞ [ 0 , 1 ] , where μ is a σ-finite measure.
Random analysis of geometrically non-linear FE modelled structures under seismic actions
1990
Abstract In the framework of the finite element (FE) method, by using the “total Lagrangian approach”, the stochastic analysis of geometrically non-linear structures subjected to seismic inputs is performed. For this purpose the equations of motion are written with the non-linear contribution in an explicit representation, as pseudo-forces, and with the ground motion modelled as a filtered non-stationary white noise Gaussian process, using a Tajimi-Kanai-like filter. Then equations for the moments of the response are obtained by extending the classical Ito's rule to vectors of random processes. The equations of motion, and the equations for moments, obtained here, show a perfect formal simi…
QUASI *-ALGEBRAS OF OPERATORS AND THEIR APPLICATIONS
1995
The main facts of the theory of quasi*-algebras of operators acting in a rigged Hilbert space are reviewed. The particular case where the rigged Hilbert space is generated by a self-adjoint operator in Hilbert space is examined in more details. A series of applications to quantum theories are discussed.
About Aczél Inequality and Some Bounds for Several Statistical Indicators
2020
In this paper, we will study a refinement of the Cauchy&ndash
Collection Principles in Dependent Type Theory
2002
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
Heyting-valued interpretations for Constructive Set Theory
2006
AbstractWe define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory (CZF). These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.
Extremal problems of approximation theory in fuzzy context
1999
Abstract The problem of approximation of a fuzzy subset of a normed space is considered. We study the error of approximation, which in this case is characterized by an L -fuzzy number. In order to do this we define the supremum of an L -fuzzy set of real numbers as well as the supremum and the infimum of a crisp set of L -fuzzy numbers. The introduced concepts allow us to investigate the best approximation and the optimal linear approximation. In particular, we consider approximation of a fuzzy subset in the space L p m of differentiable functions in the L q -metric. We prove the fuzzy counterparts of duality theorems, which in crisp case allows effectively to solve extremal problems of the…
Logics with counting and equivalence
2014
We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.