Algebras of binary formulas for ℵ0-categorical weakly circularly minimal theories: monotonic case
Қарағанды университетінің хабаршысы. Математика сериясыThis article concerns the notion of weak circular minimality being a variant of o-minimality for circularly ordered structures. Algebras of binary isolating formulas are studied for countably categorical weakly circularly minimal theories of convexity ...
B.Sh. Kulpeshov, S.V. Sudoplatov
doaj +2 more sources
On Deterministic and Absorbing Algebras of Binary Formulas of Polygonometrical Theories
Известия Иркутского государственного университета: Серия "Математика", 2017 Algebras of distributions of binary isolating and semi-isolating formulas are derived structures for a given theory. These algebras reflect binary links between realizations of 1-types defined by formulas of the initial theory.
D. Emelyanov, S. Sudoplatov
doaj +1 more source
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs [PDF]
, 2017 We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables.
Gurjar, Rohit +2 more
core +1 more source
On formulas for decoding binary cyclic codes [PDF]
, 2007 We adress the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to find the error locator polynomial in terms of the syndroms of the received word ...
Augot, Daniel +2 more
core +8 more sources
Algebras of Distributions of Binary Formulas for Theories of Archimedean Solids
Известия Иркутского государственного университета: Серия "Математика", 2019 Algebras of distributions of binary isolating and semi-isolating formulas are derived objects for given theory and reflect binary formula relations between realizations of 1-types.
D.Yu. Emelyanov
doaj +1 more source
Computing hypergeometric functions rigorously [PDF]
, 2016 We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions ${}_0F_1$, ${}_1F_1$, ${}_2F_1$ and ${}_2F_0$ (or the Kummer $U$-function) are supported for unrestricted complex parameters and ...
Johansson, Fredrik
core +5 more sources
Applying Formal Methods to Networking: Theory, Techniques and Applications [PDF]
, 2013 Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today.
Hasan, Osman, Qadir, Junaid
core +1 more source
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs [PDF]
, 2015 A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly
Gurjar, Rohit +3 more
core +3 more sources
The exp-log normal form of types [PDF]
, 2016 Lambda calculi with algebraic data types lie at the core of functional programming languages and proof assistants, but conceal at least two fundamental theoretical problems already in the presence of the simplest non-trivial data type, the sum type ...
Ahmad A. +5 more
core +4 more sources
Forcing of infinity and algebras of distributions of binary semi-isolating formulas for strongly minimal theories [PDF]
, 2013 We apply a general approach for distributions of binary isolating and semi-isolating formulas to the class of strongly minimal theories.
S. Sudoplatov
semanticscholar +1 more source