Results 11 to 20 of about 43,286 (100)

Counter Simulations via Higher Order Quantifier Elimination: a preliminary report [PDF]

, 2017
Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations.
Ghilardi, Silvio, Pagani, Elena
core   +2 more sources

The prospects for mathematical logic in the twenty-first century [PDF]

, 2001
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris, Anand Pillay, Richard A, Richard A. Shore, Samuel R. Buss   +4 more
core   +3 more sources

Tertiary-Treated Municipal Wastewater is a Significant Point Source of Antibiotic Resistance Genes Into Duluth-Superior Harbor [PDF]

, 2011
In this study, the impact of tertiary-treated municipal wastewater on the quantity of several antibiotic resistance determinants in Duluth-Superior Harbor was investigated by collecting surface water and sediment samples from 13 locations in Duluth ...
Allen H. K., Alonso A., Amann R. I., Andersson D. I., Arthurson V., Auerbach E. A., Benson D. A., Berhardt A. E., Berhardt A. E., Canton R., Cardinale M., Chopra I., Cotner J. B., David T. Tan, Davies J., Diehl D. L., D’Costa V. M., Ghosh S., Graham D. W., Jessica J. Eichmiller, Levy S. B., Levy S. B., Ling L. L., Lipsitch M., Martínez J., Merlin C., Mi Yan, Moura A., Munir M., Nelson D. K., Novo A., Patrick J. McNamara, Pruden A., Ramsden S. J., Sambrook J., Seurinck S., Smith D. L., Sommer M. O. A., Staley J. T., Storteboom H., Tchobanoglous G., Thioulouse J., Thompson J. D., Timothy M. LaPara, Tucker R. Burch, Xi C., Yi L., Zhang T., Zhang X., Zhang X.-X.   +49 more
core   +3 more sources

The Strength of Abstraction with Predicative Comprehension

, 2015
Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law V from Frege's
Walsh, Sean
core   +1 more source

From Nonstandard Analysis to various flavours of Computability Theory

, 2017
As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA).
A Connes, A Connes, A Robinson, AS Troelstra, B Berg van den, E Bishop, E Nelson, HJ Keisler, HJ Keisler, MG Katz, U Kohlenbach, V Kanovei   +11 more
core   +1 more source

Reverse Mathematics and parameter-free Transfer

, 2018
Recently, conservative extensions of Peano and Heyting arithmetic in the spirit of Nelson's axiomatic approach to Nonstandard Analysis, have been proposed.
Berg, Benno van den, Sanders, Sam
core   +1 more source

The "MIND" Scalable PIM Architecture [PDF]

, 2005
MIND (Memory, Intelligence, and Network Device) is an advanced parallel computer architecture for high performance computing and scalable embedded processing.
Brodowicz, Maciej, Sterling, Thomas
core   +1 more source

Changing a semantics: opportunism or courage?

, 2014
The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic.
A. Chagrov, A. Gil-Luezas, A. Mann, A. Mostowski, A. Pasztor, B. Davey, B. Ganter, B. Jónsson, B. ten Cate, D. Cantone, D. Gallin, D. Harel, D. Hilbert, D. Kozen, E. Bishop, E. Lopez-Escobar, G. Bezhanishvili, G. Sambin, H. Andréka, H. Andréka, H. Andréka, H. Andréka, H. Enderton, H.-D. Ebbinghaus, H.A. Priestley, H.A. Priestley, I. Walukiewicz, J. Akkanen, J. Barwise, J. Barwise, J. Barwise, J. Benthem van, J. Benthem van, J. Benthem van, J. Benthem van, J. Benthem van, J. Benthem van, J. Benthem van, J. Hintikka, J. Madarász, J. Väänänen, J. Väänänen, J. Väänänen, K. Kunen, L. Csirmaz, L. Esakia, L. Henkin, L. Henkin, L. Henkin, L. Henkin, L. Henkin, L. Henkin, L. Henkin, L. Henkin, L. Humberstone, L. Santocanale, L. Santocanale, M. Dunn, M. Dunn, M. Gehrke, M. Kracht, M. Manzano, M. Manzano, M.O. Rabin, N. Bezhanishvili, N. Bezhanishvili, N. Galatos, P. Blackburn, P. Hájek, R. Kaye, R. Montague, R.L. Vaught, S. Ambler, S. Feferman, S. Simpson, S.K. Thomason, T. Gergely, T. Hyttinen, V. Marra, V. Stebletsova, W. Blok, W. Holliday, W. Walkoe, Y. Venema, Y. Venema   +84 more
core   +1 more source

On the mathematical and foundational significance of the uncountable

, 2018
We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindel\"of lemma published in 1895 and 1903.
Normann, Dag, Sanders, Sam
core   +1 more source

Grilliot's trick in Nonstandard Analysis

, 2017
The technique known as Grilliot's trick constitutes a template for explicitly defining the Turing jump functional $(\exists^2)$ in terms of a given effectively discontinuous type two functional. In this paper, we discuss the standard extensionality trick:
Sanders, Sam
core   +1 more source