default search action
International Journal of Foundations of Computer Science, Volume 6
Volume 6, Number 1, March 1995
- Ricardo A. Baeza-Yates, Patricio V. Poblete:
Higher-Order Analysis of 2-3 Trees. 1-10 - Ilmir Kh. Musikaev, Michael A. Taitslin:
Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility. 11-26 - Jaakko Hintikka, Gabriel Sandu:
What is the Logic of Parallel Processing? 27-49 - Miquel Monserrat, Francesc Rosselló, Joan Torrens:
When is a Category of Many-Sorted Partial Algebras Cartesian-Closed? 51-66 - James Haralambides, Spyros Tragoudas:
Bipartitioning into Overlapping Sets. 67-88 - Sanjay Jain:
An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings. 89-94
Volume 6, Number 2, June 1995
- Stephen L. Bloom, Zoltán Ésik:
Some Equational Laws of Initiality in 2CCC's. 95-118 - Philippe Besnard, Jürg Kohlas:
Evidence Theory Based on General Consequence Relations. 119-135 - Vikraman Arvind, Johannes Köbler, Rainer Schuler:
On Helping and Interactive Proof Systems. 137-153 - Andrea Clementi, Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks. 155-168 - Wuxu Peng, S. Purushothaman Iyer:
A New Typee of Pushdown Automata on Infinite Trees. 169-186
Volume 6, Number 3, September 1995
- Sususmu Hayashi, Satoshi Kobayashi:
A New Formalization of Feferman's System of Functions and Classes and Its Relation to Frege Structure. 187-202 - Yukiyoshi Kameyama:
A Type-Free Theory of Half-Monotone Inductive Definitions. 203-234 - Scott F. Smith:
Hybrid Partial-Total Type Theory. 235-263 - Ian A. Mason, Carolyn L. Talcott:
Reasoning About Object Systems in VTLoE. 265-298 - Michael Beeson:
Using Nonstandard Analysis to Ensure the Correctness of Symbolic Computations. 299-338
Volume 6, Number 4, December 1995
- Wieslaw Szwast:
A Note on the Asymptotic Probabilities of Existential Second-Order Minimal Gödel Sentences with Equality. 339-351 - Ilaria Castellani:
Observing Distribution in Processes: Static and Dynamic Localities. 353-393 - Jean-Christophe Dubacq:
How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata. 395-402 - Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Nondeterministically Selective Sets. 403-416 - N. Raja, R. K. Shyamasundar:
The Quine-Bernays Combinatory Calculus. 417-430 - Anna Slobodová:
On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata. 431-446
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.