Results 1  10
of
10
Computing With FirstOrder Logic
, 1995
"... We study two important extensions of firstorder logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results are obtaine ..."
Abstract

Cited by 52 (13 self)
 Add to MetaCart
We study two important extensions of firstorder logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results are obtained using a powerful normal form for while which shows that each while computation over an unordered domain can be reduced to a while computation over an ordered domain via a fixpoint query. The fixpoint query computes an equivalence relation on tuples which is a congruence with respect to the rest of the computation. The same technique is used to show that equivalence of tuples and structures with respect to FO formulas with bounded number of variables is definable in fixpoint. Generalizing fixpoint and while, we consider more powerful languages which model arbitrary computation interacting with a database using a finite set of FO queries. Such computation is modeled by a relational machine...
Fixpoint Logics, Relational Machines, and Computational Complexity
 In Structure and Complexity
, 1993
"... We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have t ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have the complexity classes between P and EXPTIME. Our parameterized fixpoint logics capture the complexity classes P, NP, PSPACE, and EXPTIME, but equality is achieved only over ordered structures. There is, however, an inherent mismatch between complexity and logic  while computational devices work on encodings of problems, logic is applied directly to the underlying mathematical structures. To overcome this mismatch, we develop a theory of relational complexity, which bridges tha gap between standard complexity and fixpoint logic. On one hand, we show that questions about containments among standard complexity classes can be translated to questions about containments among relational complex...
Computational foundations of basic recursive function theory
 Journal of Theoretical Computer Science
, 1993
"... ..."
Effective Applicative Structures
 In: Proceedings of the 6th biennial conference on Category Theory in Computer Science (CTCS'95). SpringerVerlag Lecture Notes in Computer Science 953 8195
, 1995
"... S. All local authors can be reached viaemail at theaddress lastname@cs.unibo.it. Written requests and comments should be addressed to tradmin@cs.unibo.it. UBLCS Technical Report Series 9320 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 9321 A Classifica ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
S. All local authors can be reached viaemail at theaddress lastname@cs.unibo.it. Written requests and comments should be addressed to tradmin@cs.unibo.it. UBLCS Technical Report Series 9320 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 9321 A Classification of Security Properties, R. Focardi, R. Gorrieri, October 1993. 9322 Real Time Systems: A Tutorial, F. Panzieri, R. Davoli, October 1993. 9323 A Scalable Architecture for Reliable Distributed Multimedia Applications, F. Panzieri, M. Roccetti, October 1993. 9324 WideArea Distribution Issues in Hypertext Systems, C. Maioli, S. Sola, F. Vitali, October 1993. 9325 On Relating Some Models for Concurrency, P. Degano, R. Gorrieri, S. Vigna, October 1993. 9326 Axiomatising ST Bisimulation Equivalence, N. Busi, R. van Glabbeek, R. Gorrieri, December 1993. 9327 A Theory of Processeswith Durational Actions, R. Gorrieri, M. Roccetti, E. Stancampiano, December1993. 941 Further Modifications t...
Effectivizing Inseparability
, 1991
"... Smullyan's notion of effectively inseparable pairs of sets is not the best effective /constructive analog of Kleene's notion of pairs of sets inseparable by a recursive set. We present a corrected notion of effectively inseparable pairs of sets, prove a characterization of our notion, and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Smullyan's notion of effectively inseparable pairs of sets is not the best effective /constructive analog of Kleene's notion of pairs of sets inseparable by a recursive set. We present a corrected notion of effectively inseparable pairs of sets, prove a characterization of our notion, and show that the pairs of index sets effectively inseparable in Smullyan's sense are the same as those effectively inseparable in ours. In fact we characterize the pairs of index sets effectively inseparable in either sense thereby generalizing Rice's Theorem. For subrecursive index sets we have sufficient conditions for various inseparabilities to hold. For inseparability by sets in the same subrecursive class we have a characterization. The latter essentially generalizes Kozen's (and Royer's later) Subrecursive Rice Theorem, and the proof of each result about subrecursive index sets is presented "Rogers style" with care to observe subrecursive restrictions. There are pairs of sets effectively inseparab...
Axiomatic Tools versus Constructive approach to Unconventional Algorithms
"... Abstract. In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the grea ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the greater power of new types of algorithms also brought the greater complexity of the algorithmic universe, demanding new tools for its study. That is why we analyze new powerful tools brought forth by the axiomatic theory of algorithms, automata and computation. 1 1
On Completability of Partial
"... A Partial Combinatory Algebra is completable if it can be extended to a total one. Klop [11, 12] gave a sufficient condition for completability of a PCA M = (M,·,K,S) in the form of ten axioms (inequalities) on terms of M. We prove that Klop’s sufficient condition is equivalent to the existence of a ..."
Abstract
 Add to MetaCart
A Partial Combinatory Algebra is completable if it can be extended to a total one. Klop [11, 12] gave a sufficient condition for completability of a PCA M = (M,·,K,S) in the form of ten axioms (inequalities) on terms of M. We prove that Klop’s sufficient condition is equivalent to the existence of an injective smn function over M (that in turns is equivalent to the Padding Lemma). This is proved by working with an alternative characterization of PCA’s, recently introduced by the authors (Effective Applicative Structures). As a corollary, we show that nine of Klop’s ten axioms are actually redundant (the so called Barendregt’s axiom is enough to guarantee completability). Moreover, we prove that any Uniformly Reflexive Structure [17, 18, 16] is completable. 1
Synthetic Computability
"... ◮ Suppose we want to study mathematical structures forming a category C, such as: ◮ smooth manifolds and differentiable maps ◮ topological spaces and continuous maps ◮ computable sets and computable maps ◮ Classical approach: objects are sets equipped with extra structure, morphisms preserve the str ..."
Abstract
 Add to MetaCart
◮ Suppose we want to study mathematical structures forming a category C, such as: ◮ smooth manifolds and differentiable maps ◮ topological spaces and continuous maps ◮ computable sets and computable maps ◮ Classical approach: objects are sets equipped with extra structure, morphisms preserve the structure. ◮ Synthetic approach: embed C in a suitable mathematical universe E (a model of intuitionistic set theory) and view structures as ordinary sets and morphisms as ordinary maps inside E. A synthetic universe for computability theory ◮ M. Hyland’s effective topos Eff is the mathematical universe suitable for computability theory. ◮ In Eff all objects and morphisms are equipped with
Article Unconventional Algorithms: Complementarity of Axiomatics and Construction
, 2012
"... entropy ..."