Results 211 to 220 of about 12,533 (241)

Finite IUML-algebras, Finite Forests and Orthopairs

Fundamenta Informaticae, 2018
We 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, Stefania Boffa, Davide Ciucci, Brunella Gerla   +3 more
openaire   +1 more source

Finite variable logic, stability and finite models

Journal of Symbolic Logic, 2001
We 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

FINITE REPLACEMENT AND FINITE HILBERT‐STYLE AXIOMATIZABILITY

Mathematical Logic Quarterly, 1992
AbstractWe define a property for varieties V, thef.r.p.(finite replacement property). If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well‐known finite base ...
Burghard Herrmann, Wolfgang Rautenberg
openaire   +2 more sources

On the finite axiomatizability of

Mathematical Logic Quarterly, 2018
AbstractThe 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   +2 more sources

Finite geometries

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott   +3 more
openaire   +2 more sources

A finite arithmetic

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   +3 more sources

On Finite Hume

Philosophia Mathematica, 2000
Abstract Neo-Ftegeanism contends that knowledge of arithmetic may be acquired by second-order logical reflection upon Hume's principle. Heck argues that Hume's principle doesn't inform ordinary arithmetical reasoning and so knowledge derived from it cannot be genuinely arithmetical.
openaire   +4 more sources

Finite Geometries

Designs, Codes and Cryptography, 2003
Blokhuis, Aart, Hirschfeld, James W. P., Jungnickel, Dieter, Thas, Joseph A.   +3 more
openaire   +2 more sources

Finite cubes and finite affine spaces

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   +2 more sources

Morse theory and finiteness properties of groups

Inventiones Mathematicae, 1997
Noel Brady, Mladen Bestvina
exaly