En este trabajo hacemos un repaso de algunas de las principales propuestas en el área de la lógica epistémica dinámica, ...

The main objective of this paper is to present the answer set programming paradigm as a tool to model and solve combinatorial ...

El proyecto tiene como objetivo estudiar la Teor´ıa de Modelos de los cuerpos algebraicamente cerrados y los cuerpos reales ...

Este trabajo de fin de grado consiste en una introducción a la matemática inversa. En ´el introduciremos la aritmética de ...

A lo largo de este trabajo nos centraremos en presentar, desarrollar y estudiar diferentes lógicas epistémicas y algunas ...

The aim of this work is to study the consequences of assuming the axiom of determinacy regarding perfect set property, ...

El presente trabajo se enmarca en el campo de la Programación Lógica y, más concretamente, en el estudio de la semántica ...

La lógica tradicional resulta muy útil para formalizar razonamientos matemáticos: teoremas, definiciones... en los que se ...

Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use as a formalization of “φ is provable ...

En este trabajo se analiza la determinación de juegos de Lipschitz y Wadge, junto con la propiedad de ordenación semilineal, ...

We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. ...

In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, b and c cards, respectively, from ...

This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and ...

Let I¦− 2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free ¦2 formulas. ...

Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local ...

In the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of size a ...

Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d=a+b+c cards. The cards ...

Let IΠ−2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free Π2 ...

Given an interpreted system, we investigate ways for two agents to communicate secrets by public announcements. For card ...

We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems ...

We develop model-theoretic techniques to obtain conservation results for first order Bounded Arithmetic theories, based ...

We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.

Let T be a recursive theory in the language of first order Arithmetic. We prove that if T extends: (a) the scheme of ...

A well known theorem proved (independently) by J. Paris and H. Friedman states that BΣn +1 (the fragment of Arithmetic ...

By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is ...

Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present–day ...

This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, ...

In a general sense, Logic studies how to derive new pieces of in- formation from previous ones. In this paper we explore ...

The main goal of this paper is to propose some geometric approaches to the computations of non-discrete P systems. The ...

In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.

In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity ...

A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory ...

In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. ...

The evolution of a P system generates a tree of computation po- tentially in¯nite where it is very difficult to set the ...

In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in ...

El presente trabajo se enmarca dentro del campo de estudio de los Modelos de la Aritmética de Peano: PA. En líneas generales, ...