Logic of proofs for bounded arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3967 LNCS, Issue , 2006, Pages 191-201

  Goris, Evan ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION TECHNOLOGY; KNOWLEDGE ACQUISITION; NUMERICAL METHODS; SEMANTICS; THEOREM PROVING;

BOUNDED ARITHMETIC; PEANO ARITHMETIC (PA); PROPOSITIONAL FRAMEWORK; PTIME COMPUTABLE;

FORMAL LOGIC;

EID: 33745920187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753728_21     Document Type: Conference Paper

References (9)

1. Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1) (2001) 1-36
2. Artemov, S., Nogina, E.: On epistemic logic with justification. In van der Meyden, R., ed.: Theoretical Aspects of Rationality and Knowledge Proceedings of the Tenth Conference (TARK 2005), June 10-12, 2005, Singapore., National University of Singapore (2005) 279-294
3. Artemov, S.: Evidence-Based Common Knowledge. Technical Report TR-2004018, CUNY Ph.D. Program in Computer Science (2004)
4. Artemov, S., Kuznets, R.: Explicit knowledge is not logically omniscient. Unpublished (2005)
5. Artemov, S.N., Beklemishev, L.D.: Provability logic. In Gabbay, D., Guenthner, F., eds.: Handbook of Philosophical Logic. Volume 13. 2nd edn. Kluwer (2004) 229-403
6. Buss, S.R.: Bounded arithmetic. Bibliopolis, Napols (1986) Revision of PhD. thesis.
7. Krajíček, J.: Bounded arithmetic, propositional logic, and complexity theory, Cambridge University Press, New York, NY, USA (1995)
8. Buss, S.R.: First-Order Theory of Arithmetic. In Buss, S.R., ed.: Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics, Vol.137. Elsevier, Amsterdam (1998) 475-546
9. Parikh, R.: Existence and feasability in arithmetic, Journal of Symbolic Logic 36 (1971) 494-508