-
614th Workshop on Logic, Language, Information and ComputationBulletin of Symbolic Logic 14 (1): 160-161. 2008.
-
5Algorithmically Broad Languages for Polynomial Time and SpaceIn Alexandra Silva, Renata Wassermann & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation: 27th International Workshop, Wollic 2021, Virtual Event, October 5–8, 2021, Proceedings, Springer Verlag. pp. 372-387. 2021.Flexible programming languages with built-in bounds on time or space resources are of obvious practical interest. Since we know that no programming language can capture exactly the PTime algorithms, the challenge is to design languages that guarantee PTime while accommodating a broad spectrum of algorithmic methods. We propose here such languages for PTime and PSpace, based on size-sensitive imperative programming, parameterless procedures, and a retooling of the ramification method.
-
4Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 22nd Workshop on Logic, Language, Information and Computation, WoLLIC 2015, held in the campus of Indiana University, Bloomington, IN, USA in July 2015. The 14 contributed papers, presented together with 8 invited lectures and 4 tutorials, were carefully reviewed and selected from 44 submissions. The focus of the workshop was on interdisciplinary research i…Read more
-
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers' (review)Springer Verlag. 1995.This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; …Read more
-
18
-
23Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexityAnnals of Pure and Applied Logic 96 (1-3): 209-229. 1999.
-
255Syntactic translations and provably recursive functionsJournal of Symbolic Logic 50 (3): 682-688. 1985.
-
34The optimality of induction as an axiomatization of arithmeticJournal of Symbolic Logic 48 (1): 182-184. 1983.
-
11Intrinsic reasoning about functional programs I: first order theoriesAnnals of Pure and Applied Logic 114 (1-3): 117-153. 2002.We propose a rudimentary formal framework for reasoning about recursion equations over inductively generated data. Our formalism admits all equational programs , and yet singles out none. While being simple, this framework has numerous extensions and applications. Here we lay out the basic concepts and definitions; show that the deductive power of our formalism is similar to that of Peano's Arithmetic; prove a strong normalization theorem; and exhibit a mapping from natural deduction derivations…Read more
-
Existential Instantiation in a System of Natural Deduction for Intuitionistic ArithmeticsStichting Mathematisch Centrum. 1973.
-
22Markov's Rule revisitedArchive for Mathematical Logic 30 (2): 125-127. 1990.We consider HA*, that is Heyting's Arithmetic extended with transfinite induction over all recursive well orderings, which may be viewed as defining constructive truth, since PA* agrees with classical truth. We prove that Markov's Principle, as a schema, is not provable in HA*, but that HA* is closed under Markov's Rule.
-
16Implicational complexity in intuitionistic arithmeticJournal of Symbolic Logic 46 (2): 240-248. 1981.
-
56On the proof theory of the modal logic for arithmetic provabilityJournal of Symbolic Logic 46 (3): 531-538. 1981.
Ridgemede, Indiana, United States of America
Areas of Specialization
Science, Logic, and Mathematics |
Areas of Interest
Science, Logic, and Mathematics |