External Links

    Journal: Int. J. Found. Comput. Sci.

    Volume 6, Issue 4

    339 -- 351Wieslaw Szwast. A Note on the Asymptotic Probabilities of Existential Second-Order Minimal Gödel Sentences with Equality
    353 -- 393Ilaria Castellani. Observing Distribution in Processes: Static and Dynamic Localities
    395 -- 402Jean-Christophe Dubacq. How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata
    403 -- 416Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang. Nondeterministically Selective Sets
    417 -- 430N. Raja, R. K. Shyamasundar. The Quine-Bernays Combinatory Calculus
    431 -- 446Anna Slobodová. On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata

    Volume 6, Issue 3

    187 -- 202S. Hayashi, S. Kobayashi. A New Formalization of Feferman s System of Functions and Classes and Its Relation to Frege Structure
    203 -- 234Yukiyoshi Kameyama. A Type-Free Theory of Half-Monotone Inductive Definitions
    235 -- 263Scott F. Smith. Hybrid Partial-Total Type Theory
    265 -- 298Ian A. Mason, Carolyn L. Talcott. Reasoning About Object Systems in VTLoE
    299 -- 338Michael Beeson. Using Nonstandard Analysis to Ensure the Correctness of Symbolic Computations

    Volume 6, Issue 2

    95 -- 118Stephen L. Bloom, Zoltán Ésik. Some Equational Laws of Initiality in 2CCC s
    119 -- 135Philippe Besnard, Jürg Kohlas. Evidence Theory Based on General Consequence Relations
    137 -- 153Vikraman Arvind, Johannes Köbler, Rainer Schuler. On Helping and Interactive Proof Systems
    155 -- 168Andrea E. F. Clementi, Miriam Di Ianni. Optimum Schedule Problems in Store and Forward Networks
    169 -- 186Wuxu Peng, S. Purushothaman Iyer. A New Typee of Pushdown Automata on Infinite Trees

    Volume 6, Issue 1

    1 -- 10Ricardo A. Baeza-Yates, Patricio V. Poblete. Higher-Order Analysis of 2-3 Trees
    11 -- 26Ilmir Kh. Musikaev, Michael A. Taitslin. Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility
    27 -- 49Jaakko Hintikka, Gabriel Sandu. What is the Logic of Parallel Processing?
    51 -- 66Miquel Monserrat, Francesc Rosselló, Joan Torrens. When is a Category of Many-Sorted Partial Algebras Cartesian-Closed?
    67 -- 88James Haralambides, Spyros Tragoudas. Bipartitioning into Overlapping Sets
    89 -- 94Sanjay Jain. An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings
    runs on