Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering. Here, we refine predicative analysis by using a ramified Ackermann’s construction of a non-primitive recursive function. We obtain a hierarchy of functions wh...

Proposed is a project (or principles) of new version for the textbook theoretical Chinese grammar based on Predicative Concept Language and continuous to 2005-2006 edition. The book would be more systematic will consider in detail non-equivalence language levels Russian; Topic-prominent typology considered depth, as well variety regional variants Chinese; impossibility assimilating same inflect...

Adjectives constitute a challenging issue for NLP applications. ¿From a syntactic viewpoint, they can be predicative or attributive. From a semantic viewpoint, their sense can vary depending on the context in which they appear. In this paper we present an overview on the lexical semantics of adjectives in Natural Language Processing, followed by the presentation of the papers included in this p...

Introduction. This is a sequel to our article “Predicative foundations of arithmetic” (1995), referred to in the following as [PFA]; here we review and clarify what was accomplished in [PFA], present some improvements and extensions, and respond to several challenges. The classic challenge to a program of the sort exemplified by [PFA] was issued by Charles Parsons in a 1983 paper, subsequently ...

In the course of carrying out NIST TRECs I created and tested a computer program for textual information searches, based on ‘understanding’ the meanings of words in texts. The computer using the program ‘understands’ not only the abstract, standardized meanings of the words in the text, but the specific, concrete meanings given to those words by the author(s) of the texts. In this article I att...

We suggest a new basic framework for the Weyl-Feferman predicativist program by constructing a formal predicative set theory PZF which resembles ZF . The basic idea is that the predicatively acceptable instances of the comprehension schema are those which determine the collections they define in an absolute way, independent of the extension of the “surrounding universe”. This idea is implemente...