Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,287,011 papers from all fields of science
Search
Sign In
Create Free Account
Arithmetic IF
The arithmetic IF statement is a three-way arithmetic conditional statement, first seen in the first release of Fortran in 1957, and found in all…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Conditional (computer programming)
FOCAL (programming language)
Three-way comparison
Broader (1)
Fortran
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Verification of fixed-point datapaths with comparator units using Constrained Arithmetic Transform (CAT)
O. Sarbishei
,
K. Radecka
IEEE International Symposium on Circuits and…
2012
Corpus ID: 20359579
Arithmetic Transform (AT) [1, 16, 17] is an efficient spectral technique, to analyze range and precision of fixed-point…
Expand
2010
2010
THE ADDrnVE STRUCTURE OF MODELS OF ARITHMETIC
L. Lipshitz
2010
Corpus ID: 53953049
. It is shown that for a model of Presburger arithmetic to have an expansion to a model of Peano arithmetic it is necessary that…
Expand
2010
2010
Arithmetic labelings and geometric labelings of countable graphs
G. R. Vijayakumar
Discussiones Mathematicae Graph Theory
2010
Corpus ID: 15881683
An injective map from the vertex set of a graph G—its order may not be finite—to the set of all natural numbers is called an…
Expand
2002
2002
Analysis of the LNS implementation of the fast affine projection algorithms
F. Albu
,
J. Kadlec
,
A. Hermanek
,
A. Fagan
,
N. Coleman
2002
Corpus ID: 3031922
It has been shown that a 32-bit logarithmic arithmetic unit can operate faster than, and maintain the accuracy of, a 32-bit…
Expand
1997
1997
The function $\lfloor a/m\rfloor$ in sharply bounded arithmetic
M. Tada
,
M. Tatsuta
Archive for Mathematical Logic
1997
Corpus ID: 5263255
Abstract. This paper proves that the division operation $\lfloor a/m\rfloor$ is provably total in the system $S_2^0$ of bounded…
Expand
1989
1989
On the strength of the interpretation method
Y. Gurevich
,
S. Shelah
Journal of Symbolic Logic (JSL)
1989
Corpus ID: 14265754
Abstract In spite of the fact that true arithmetic reduces to the monadic second-order theory of the real line, Peano arithmetic…
Expand
1986
1986
The Use Of Pivoting To Improve The Numerical Performance Of Toeplitz Solvers
D. Sweet
Optics & Photonics
1986
Corpus ID: 120041314
Levinson's Toeplitz solver breaks down if any leading principal minors are zero, and recently methods have been proposed to…
Expand
1982
1982
Propositional and first-order predicate calculus applied to the study of program correctness.
Kenneth G. Krauss
1982
Corpus ID: 124749571
1980
1980
The computed GOTO, logical and arithmetic IF statements
R. Hutty
1980
Corpus ID: 124079230
There is an extended form of the simple GOTO statement called the Computed GOTO statement, which is used to go to one of several…
Expand
1969
1969
Strong representability of partial functions in arithmetic theories
R. Ritchie
,
P. Young
Information Sciences
1969
Corpus ID: 41257620
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE