Publications

Authors:

Köpp, Nils; Petrakis, Iosif

Title:

Strong negation in the theory of computable functionals TCF

Year:

2025

Type of item:

Articolo in Rivista

Tipologia ANVUR:

Articolo su rivista

Language:

Inglese

Format:

Elettronico

Referee:

Sì

Name of journal:

LOGICAL METHODS IN COMPUTER SCIENCE

ISSN of journal:

1860-5974

N° Volume:

Volume 21, Issue 2

Page numbers:

1-28

Keyword:

Higher order computability, constructive mathematics, strong negation

Short description of contents:

We incorporate strong negation in the theory of computable functionals TCF, a common extension of Plotkin’s PCF and Goedel’s system T, by defining simultaneously strong negation of a formula and strong negation of a predicate P in TCF. As a special case of the latter, we get strong negation of an inductive and a coinductive predicate of TCF.

Web page:

https://lmcs.episciences.org/15465

Product ID:

144973

Handle IRIS:

11562/1159069

Last Modified:

April 7, 2025

Bibliographic citation:

Köpp, Nils; Petrakis, Iosif, Strong negation in the theory of computable functionals TCF «LOGICAL METHODS IN COMPUTER SCIENCE» , vol. Volume 21, Issue 2 , 2025 , pp. 1-28

Consulta la scheda completa presente nel repository istituzionale della Ricerca di Ateneo