Article

Free access

Functional interpretations of feasibly constructive arithmetic

Authors:

S. Cook,

A. UrquhartAuthors Info & Claims

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

Pages 107 - 112

https://doi.org/10.1145/73007.73017

Published: 01 February 1989 Publication History

PDF eReader

References

[1]

Errctt Bishop. M~thematics as a numerical langllage, in J. Myhill A. Kino and R.E. Ves}cy, e(litors, Inluilionism and Proof Theory: Proceedivgs of the Summer Cov ferencc at BTtffalo, New York, 1968, pages 53--71. North-Holland, Amsterdam, 1970.

Google Scholar

[2]

Samuel R. Buss. Bounded Arithmetic. Ph.D. dissertation, Princeton University 1985; reprinted Bibliopolis, Nap}es, 1q86. Page references are to the reprinting.

Google Scholar

[3]

Samuel R. Buss. The polynomial hierarchy and intuitionistic bounded arithmetic, 1986. Structure in Complexity Theory, Springer-Verlag Lecture Notes in Computer Science No. 223, pp. 77-103.

Digital Library

Google Scholar

[4]

Peter Clote and Gaisi Takeuti. Exponential time and bounded arithmetic, 1986. Structure in Comple~city Theory, Springer-Verlag Lecture Notes in Computer Science No. 223, pp. 125-143.

Digital Library

Google Scholar

[5]

Alan Cobham. The intrinsic computational difficulty of functions. In Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Sciences, pages 24-30, 1964.

Google Scholar

[6]

Stephen Cook and Alasdair Urquhart. Functional Interpretations of Feasibly Constructive Arithmetic. Technical Report 210/88, University of Toronto, 1988.

Google Scholar

[7]

Stephen A. Cook. Feasibly constructive proofs and the propositional calculus. In Proc. 7lh A.C.M. Symposium on the Theory of Computation, pages 83-97, 1975.

Digital Library

Google Scholar

[8]

Stephen A. Cook ~nd Robert A. Reckhow. The relative ej~ciency of propositional proof systems. J. Symbolic Logic, 44(1):36-50, March 1979.

Crossref

Google Scholar

[9]

Kurt GSdel. 0ber eine bisher noch nicht beniitzte erweiterung des finiten standpunktes. Dialectica 12, 280-287. English translation: j. of Philosophical Logic 9 (1980), 133-142. Revised and expanded English translation to appear ill Volume II of GSdel's Collected Works.

Google Scholar

[10]

A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.

Crossref

Google Scholar

[11]

A.S. Troelstra. MetamathematicM investigation of intuitionistic arithmetic and analysis, 1973. Springer-Verlag Lecture Notes in Mathematics, No. 344.

Google Scholar

Cited By

View all

Alam AMoniri M(2022)Models of Bounded Arithmetic Theories and Some Related Complexity QuestionsBulletin of the Section of Logic10.18778/0138-0680.2022.0351:2(163-176)Online publication date: 7-Jun-2022
https://doi.org/10.18778/0138-0680.2022.03
Das AKoskinen EGrohe MShankar N(2016)From positive and intuitionistic bounded arithmetic to monotone proof complexityProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934570(126-135)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934570
Gaboardi MPéchoux R(2015)Algebras and coalgebras in the light affine Lambda calculusACM SIGPLAN Notices10.1145/2858949.278475950:9(114-126)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784759
Show More Cited By

Index Terms

Functional interpretations of feasibly constructive arithmetic
1. Theory of computation

Recommendations

Options for Denormal Representation in Logarithmic Arithmetic
Abstract
Economical hardware often uses a FiXed-point Number System (FXNS), whose constant absolute precision is acceptable for many signal-processing algorithms. The almost-constant relative precision of the more expensive Floating-Point (FP) number ...
High-Level Design of Multiple-Valued Arithmetic Circuits Based on Arithmetic Description Language
ISMVL '08: Proceedings of the 38th International Symposium on Multiple Valued Logic

This paper proposes a high-level design method of multiple-valued arithmetic circuits. The proposed method uses a cell-based approach with a dedicated hardware description language called ARITH. By using ARITH, we can describe and verify any binary/...
High speed computer arithmetic architectures

Comments

Information & Contributors

Information

Published In

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

February 1989

600 pages

ISBN:0897913078

DOI:10.1145/73007

Editor:
D. S. Johnson

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC89

Sponsor:

SIGACT

STOC89: 21st Annual ACM Symposium on the Theory of Computing

May 14 - 17, 1989

Washington, Seattle, USA

Acceptance Rates

STOC '89 Paper Acceptance Rate 56 of 196 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
265
Total Downloads

Downloads (Last 12 months)76
Downloads (Last 6 weeks)9

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alam AMoniri M(2022)Models of Bounded Arithmetic Theories and Some Related Complexity QuestionsBulletin of the Section of Logic10.18778/0138-0680.2022.0351:2(163-176)Online publication date: 7-Jun-2022
https://doi.org/10.18778/0138-0680.2022.03
Das AKoskinen EGrohe MShankar N(2016)From positive and intuitionistic bounded arithmetic to monotone proof complexityProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934570(126-135)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934570
Gaboardi MPéchoux R(2015)Algebras and coalgebras in the light affine Lambda calculusACM SIGPLAN Notices10.1145/2858949.278475950:9(114-126)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784759
Gaboardi MPéchoux RFisher KReppy J(2015)Algebras and coalgebras in the light affine Lambda calculusProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784759(114-126)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784759
Ramyaa RLeivant D(2010)Feasible functions over co-inductive dataProceedings of the 17th international conference on Logic, language, information and computation10.5555/1886790.1886806(191-203)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1886790.1886806
Ramyaa RLeivant D(2010)Feasible Functions over Co-inductive DataLogic, Language, Information and Computation10.1007/978-3-642-13824-9_16(191-203)Online publication date: 2010
https://doi.org/10.1007/978-3-642-13824-9_16
Constable R(2005)Expressing computational complexity in constructive type theoryLogic and Computational Complexity10.1007/3-540-60178-3_82(131-144)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-60178-3_82
Li C(2004)Asymptotic Behaviors of Type-2 Algorithms and Induced Baire TopologiesExploring New Frontiers of Theoretical Informatics10.1007/1-4020-8141-3_36(465-478)Online publication date: 2004
https://doi.org/10.1007/1-4020-8141-3_36
Irwin RRoyer JKapron B(2001)On characterizations of the basic feasible functionals, Part IJournal of Functional Programming10.1017/S095679680000384111:1(117-153)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.1017/S0956796800003841
Royer J(1997)Semantics vs Syntax vs ComputationsJournal of Computer and System Sciences10.1006/jcss.1997.148754:3(424-436)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1006/jcss.1997.1487
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Options for Denormal Representation in Logarithmic Arithmetic

High-Level Design of Multiple-Valued Arithmetic Circuits Based on Arithmetic Description Language

High speed computer arithmetic architectures