Finite Arithmetics

Authors:
Michał Krynicki;Marcin Mostowski;Konrad Zdanowski
Affiliations:
Faculty of Mathematics and Natural Sciences, Cardinal Stefan Wyszyński Uniwersity, Warsaw, Poland. E-mail: m.krynicki@uksw.edu.pl;Department of Logic, Institute of Philosophy, Warsaw University, Poland and Institute of Technology, University of Clermont 1. E-mail: m.mostowski@uw.edu.pl;Institute of Mathematics, Polish Academy of Science, Warsaw, Poland. E-mail: konrad.zdanowski@wp.pl
Venue:
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Year:
2007

Citing 7
Cited 1

On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Recursion theory

Recursion theory
An axiomatic basis for computer programming

Communications of the ACM
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Arithmetic, first-order logic, and counting quantifiers

ACM Transactions on Computational Logic (TOCL)
Coprimality in finite models

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
FM-Representability and beyond

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Theories of initial segments of standard models of arithmetics and their complete extensions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents the current state of knowledge in the field of logical investigations of finite arithmetics. This is an attempt to summarize the ideas and results in this area. Some new results are presented - these are mainly generalizations of the earlier results related to properties of sl-theories and some nontrivial cases of FM-representability theorem.