# Peano axioms

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- CSL
- 2012

Interactive realizability is a computational semantics of classical Arithmetic. It is based on interactive learning and was… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- The American economic review
- 2006

We propose that a simple "dual-self" model gives a unified explanation for several empirical regularities, including the apparent… (More)

Is this relevant?

2004

2004

- Discrete Mathematics
- 2004

The induced path transit function J (u; v) in a graph consists of the set of all vertices lying on any induced path between the… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ECAI
- 2004

In the area of Description Logic (DL) based knowledge representation, research on reasoning w.r.t. general terminologies has… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Int. J. Approx. Reasoning
- 1996

This paper presents and compares two views of the theory of rough sets. The operator-oriented view interprets rough set theory as… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- J. ACM
- 1989

Today's standard model for database concurrency control, called serializability theory, represents executions of transactions as… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Sci. Comput. Program.
- 1987

We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be viewed as… (More)

Is this relevant?

1983

1983

- Theor. Comput. Sci.
- 1983

We develop the proof theory of Hoare’s logic for the partial correctness of whileprograms applied to arithmetic as it is defined… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- 1982

Recently some interesting first-order statements independent of Peano Arithmetic (P) have been found. Here we present perhaps the… (More)

Is this relevant?

1982

1982

- Theor. Comput. Sci.
- 1982

We answer affirmatively a conjecture of J.A. Bergstra et al. [l] showing input-output correctness theories determine program… (More)

Is this relevant?