Results 281 to 290 of about 1,331,302 (315)
Some of the next articles are maybe not open access.
Finitely Repeated Games with Finite Automata
Mathematics of Operations Research, 1998In honor of R. J. Aumann's 65th birthday The paper studies the implications of bounding the complexity of the strategies players may select, on the set of equilibrium payoffs in repeated games. The complexity of a strategy is measured by the size of the minimal automation that can implement it.
openaire +1 more source
Applied Categorical Structures, 2009
The paper analyses the relation between various finiteness classes in ZF set theory without Choice. It starts with an an extensive background collecting citations of the most influential mathematicians and philosophers (Weyl, Hilbert, Russell, Pascal, Galileo, Leibniz, Bolzano, Dedekind, von Neumann) on the nature of infinity.
openaire +2 more sources
The paper analyses the relation between various finiteness classes in ZF set theory without Choice. It starts with an an extensive background collecting citations of the most influential mathematicians and philosophers (Weyl, Hilbert, Russell, Pascal, Galileo, Leibniz, Bolzano, Dedekind, von Neumann) on the nature of infinity.
openaire +2 more sources
A hybrid Finite Integration–Finite Volume Scheme
Journal of Computational Physics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sascha M. Schnepp +2 more
openaire +2 more sources
Finite IUML-algebras, Finite Forests and Orthopairs
Fundamenta Informaticae, 2018We show that finite IUML-algebras, which are residuated lattices arising from an idempotent uninorm, can be interpreted as algebras of sequences of orthopairs whose main operation is defined starting from the three-valued Sobociński operator between rough sets. Our main tool is the representation of finite IUML-algebras by means of
Stefano Aguzzoli +3 more
openaire +1 more source
2010
In Budugh, a small Daghestanian language spoken in Azerbaijan, verb-stems, defined as verb forms uninflected for tense or mood, can be used either as dependent of nouns (‘participles’) and other predicates (verbal nouns or hereafter ‘masdars’, and ‘sequential converbs’) or as finite non-indicative verb forms, that is with modal use, especially in a ...
openaire +1 more source
In Budugh, a small Daghestanian language spoken in Azerbaijan, verb-stems, defined as verb forms uninflected for tense or mood, can be used either as dependent of nouns (‘participles’) and other predicates (verbal nouns or hereafter ‘masdars’, and ‘sequential converbs’) or as finite non-indicative verb forms, that is with modal use, especially in a ...
openaire +1 more source
Finite cubes and finite affine spaces [PDF]
Australas. J Comb., 1992 The paper starts with certain analogues in finite 3-dimensional affine spaces, of the ordinary cube. From the properties of these structures as geometric lattices, the notion of an abstract finite cube is derived. Perfectness of finite cubes is defined considering also the properties of certain groups associated with the cube.
openaire +1 more source
On the finite axiomatizability of
Mathematical Logic Quarterly, 2018AbstractThe question of whether the bounded arithmetic theoriesandare equal is closely connected to the complexity question of whetheris equal to. In this paper, we examine the still open question of whether the prenex version of,, is equal to. We give new dependent choice‐based axiomatizations of the‐consequences ofand.
openaire +1 more source
Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilaria Cardinali +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilaria Cardinali +3 more
openaire +2 more sources
Journal of Symbolic Logic, 1973
In this paper I shall argue that the presumption of infinitude may be excised from the area of mathematics known as natural number theory with no substantial loss. Except for a few concluding remarks, I shall restrict my concern in here arguing the thesis to the business of constructing and developing a first-order axiomatic system for arithmetic ...
openaire +2 more sources
In this paper I shall argue that the presumption of infinitude may be excised from the area of mathematics known as natural number theory with no substantial loss. Except for a few concluding remarks, I shall restrict my concern in here arguing the thesis to the business of constructing and developing a first-order axiomatic system for arithmetic ...
openaire +2 more sources
Finite variable logic, stability and finite models
Journal of Symbolic Logic, 2001We will study complete Ln-theories and their models, where Ln is the set of first order formulas in which at most n distinct variables occur. Here, by a complete Ln-theory we mean a theory such that for every Ln-sentence, it or its negation is implied by the theory. Hence, a complete Ln-theory need not necessarily be complete in the usual sense.
openaire +1 more source