Results 191 to 200 of about 6,017,875 (219)
Some of the next articles are maybe not open access.
Computational Complexity Via Finite Types
ACM Transactions on Computational Logic, 2015We address computational complexity writing polymorphic functions between finite types (i.e., types with a finite number of canonical elements), expressing costs in terms of the cardinality of these types.
openaire +1 more source
Fr�chet algebras of finite type
Archiv der Mathematik, 2004A Fréchet algebra is a locally multiplicatively convex, complete, topological algebra the topology of which arises from an increasing countable family \(\{p_j\}\) of submultiplicative seminorms such that the intersection of their kernels is just zero. Let \(\chi\) be an inverse (projective) limit sequence of Banach algebras and let \(\lim_{\leftarrow ...
openaire +2 more sources
2019
We introduced and defined rings and modules of finite type in Section 8.1, but then the rest of Chapter 8 was devoted to studying modules of type ≤ 2. (Auslander– Bridger modules and dual Auslander–Bridger modules do not have type ≤ 2 in general, but they do have semilocal endomorphism rings.) In this chapter we will see some further results on modules
openaire +1 more source
We introduced and defined rings and modules of finite type in Section 8.1, but then the rest of Chapter 8 was devoted to studying modules of type ≤ 2. (Auslander– Bridger modules and dual Auslander–Bridger modules do not have type ≤ 2 in general, but they do have semilocal endomorphism rings.) In this chapter we will see some further results on modules
openaire +1 more source
An Overview of Finite/Fixed-Time Control and Its Application in Engineering Systems
IEEE/CAA Journal of Automatica Sinica, 2022Xiaodi Li, Renquan Lu, Hongyi Li
exaly
1977
In this chapter we treat the theory of functionals of finite type in which, following K Godel [2] pure number theory can be interpreted (§19). The functionals concerned are introduced in §15 and they are shown to be calculable in §16 following W. Howard by transfinite induction up to ee0, in fact, by using the ordinal terms of §14.
openaire +1 more source
In this chapter we treat the theory of functionals of finite type in which, following K Godel [2] pure number theory can be interpreted (§19). The functionals concerned are introduced in §15 and they are shown to be calculable in §16 following W. Howard by transfinite induction up to ee0, in fact, by using the ordinal terms of §14.
openaire +1 more source
Finite-density lattice QCD and sign problem: Current status and open problems
Progress in Particle and Nuclear Physics, 2022Keitaro Nagata
exaly
Optimization of thermal systems based on finite-time thermodynamics and thermoeconomics
Progress in Energy and Combustion Science, 2004Oguz Salim Sogut +2 more
exaly
Mixed finite elements for solving 2-D diffusion-type equations
Reviews of Geophysics, 2010Anis Younes +2 more
exaly
Modeling finite-volume effects and chiral symmetry breaking in two-flavor QCD thermodynamics
Physics Reports, 2017Bertram Klein
exaly