13,871 research outputs found
Indeterminateness and `The' Universe of Sets: Multiversism, Potentialism, and Pluralism
In this article, I survey some philosophical attitudes to talk concerning `the' universe of sets. I separate out four different strands of the debate, namely: (i) Universism, (ii) Multiversism, (iii) Potentialism, and (iv) Pluralism. I discuss standard arguments and counterarguments concerning the positions and some of the natural mathematical programmes that are suggested by the various views
Program conversing in Portugese providing a library service
TUGA is a program which converses in Portuguese to
provide a library service covering the field of
Artificial Intelligence. The objective of designing the program TUGA was the
development of a feasible method for consulting and
creating data bases in natural Portuguese. The resulting program allows dialogues where the
program and its users behave in the way humans normally
do in a dialogue setting. The program can answer/ and
question in pre-defined scenarios. Users can question/
answer and issue commands in a natural and convenient
way/ without bothering excessively with the form of the
dialogues and sentences. The original contributions of this work are: the
treatment of dialogues. the adaptation of Colmerauer's
natural language framework to Portuguese, the particular
method for evaluating the logical structures involved in
Colmerauer's framework, and the library service
application itself. The program is implemented in Prolog, a simple and
surprisingly powerful programming language essentially
identical in syntax and semantics to a subset of
predicate calculus in clausal form
A recovery operator for non-transitive approaches
In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities.Fil: Barrio, Eduardo Alejandro. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Instituto de Investigaciones Filosóficas - Sadaf; ArgentinaFil: Pailos, Federico Matias. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Instituto de Investigaciones Filosóficas - Sadaf; ArgentinaFil: Szmuc, Damián Enrique. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Instituto de Investigaciones Filosóficas - Sadaf; Argentin
Logic Programming Applications: What Are the Abstractions and Implementations?
This article presents an overview of applications of logic programming,
classifying them based on the abstractions and implementations of logic
languages that support the applications. The three key abstractions are join,
recursion, and constraint. Their essential implementations are for-loops, fixed
points, and backtracking, respectively. The corresponding kinds of applications
are database queries, inductive analysis, and combinatorial search,
respectively. We also discuss language extensions and programming paradigms,
summarize example application problems by application areas, and touch on
example systems that support variants of the abstractions with different
implementations
- …