Results 1 to 10 of about 43,510 (137)

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 computational content of Nonstandard Analysis [PDF]

, 2016
Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs.
Sanders, Sam
core   +3 more sources

Liveness-Driven Random Program Generation [PDF]

, 2017
Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing.
B Steffen, Christopher Lidbury, E Nagai, F Kirchner, F Nielson, FE Allen, J Cocke, Jan Midtgaard, Maulik A. Dave, SL Graham, Vu Le, X Leroy, Xuejun Yang   +12 more
core   +3 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

Bidirectional syntactic priming across cognitive domains: from arithmetic to language and back [PDF]

, 2014
Scheepers et al. (2011) showed that the structure of a correctly solved mathematical equation affects how people subsequently complete sentences containing high vs. low relative-clause attachment ambiguities.
Frazier L., Friederici A. D., Hardin J.
core   +2 more sources

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

Non-principal ultrafilters, program extraction and higher order reverse mathematics

, 2011
We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher order arithmetic. Let U be the statement that a non-principal ultrafilter exists and let ACA_0^{\omega} be the higher order extension of ACA_0. We show
ALEXANDER P. KREUZER, Kleene S. C., Kohlenbach U.   +2 more
core   +1 more source

Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems [PDF]

, 2017
We describe the first results of a project of analyzing in which theories formal proofs can be ex- pressed. We use this analysis as the basis of interoperability between proof systems.Comment: In Proceedings PxTP 2017, arXiv:1712 ...
Dowek, Gilles
core   +2 more sources