[1988] Proceedings. Third Annual Symposium on Logic in Computer Science

5-8 July 1988

Filter Results

Displaying Results 1 - 25 of 44
  • 0-1 laws and decision problems for fragments of second-order logic

    Publication Year: 1988, Page(s):2 - 11
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Fragments of existential second-order logic are investigated in which the patterns of first order quantifiers are restricted. The focus is on the class Sigma /sub 1//sup 1/ (Ackermann) of existential second-order sentences in which the first-order part belongs to the Ackermann class, i.e. it contains at most one universal first-order quantifier. All properties expressible by Sigma /sub 1//sup 1/ (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebra and a logic for NC/sup 1/

    Publication Year: 1988, Page(s):12 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    An algebra and a logic characterizing the complexity class NC/sup 1/, which consists of functions computed by uniform sequences of polynomial-size, log depth circuits, are presented. In both characterizations, NC/sup 1/ functions are regarded as functions from one class of finite relational structures to another. In the algebraic characterization, upward and downward tree recursion are applied to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving unprovability

    Publication Year: 1988, Page(s):22 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB)

    A formal proof system for unprovability in the predicate calculi is developed. This system is shown to be complete with respect to the logic of finite structures. It can be used to extend the 'negation by failure' of Prolog, prevent infinite loops in a deductive data base or Prolog, or prove formulaes in nonmonotonic (default) logic.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial correctness of C-MOS switching circuits: an exercise in applied logic

    Publication Year: 1988, Page(s):28 - 36
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (725 KB)

    The possibility of extending some of the logical methods that have been recommended for the design of software to the design of hardware, in particular, of synchronous switching circuits implemented in CMOS, is explored. The objective is to design networks that are known by construction. Things that can go wrong with circuits designed in this way are examined. The application of the techniques is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modest model of records, inheritance and bounded quantification

    Publication Year: 1988, Page(s):38 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (885 KB)

    The authors give a formal semantics for the language Bounded Fun, which supports both parametric and subtype polymorphism. They show how to use partial equivalence relations to model inheritance in this language, which supports the notion of subtype and record types. A generalization of partial equivalence relations, known as omega -sets, is used in combination with modest sets to provide the firs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fixed point of the second order lambda-calculus: observable equivalences and models

    Publication Year: 1988, Page(s):51 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (493 KB)

    The author develops an operational model of an impredicative version of explicit polymorphism, namely, an extension of the second-order lambda-calculus, including a fixed-point combinator and a multisorted first-order algebra. He shows that the typical properties of the lambda -calculus are preserved, and he investigates novel aspects that arise from second-order type structure as well as the rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of typings in polymorphic type discipline

    Publication Year: 1988, Page(s):61 - 70
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Polymorphic type discipline for lambda -calculus is an extension of H.B. Curry's (1969) classical functionality theory, in which types can be universally quantified. An algorithm that, given a term M, builds a set of constraints, is satisfied. Moreover, all the typings for M (if any) are built from the set of constraints by substitutions. Using the set of constraints, some properties of polymorphi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computational power of universally polymorphic recursion

    Publication Year: 1988, Page(s):72 - 81
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (543 KB)

    ML/sup +/ is an extension of the functional language ML that allows the actual parameters of recursively called functions to have types that are generic instances of the (derived) types of corresponding formal parameters. It is shown that the polymorphism allowed by the original ML can be eliminated without loss of computational power, specifically, it is shown that its computational power (in all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining algebra and higher-order types

    Publication Year: 1988, Page(s):82 - 90
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 KB)

    The author studies the higher-order rewrite/equational proof systems obtained by adding the simply typed lambda calculus to algebraic rewrite/equational proof systems. He shows that if a many-sorted algebraic rewrite system has the Church-Rosser property, then the corresponding higher-order rewrite system which adds simply typed beta -reduction has the Church-Rossers property too. This result is r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing X-separability and one-side invertibility in lambda - beta - Omega -calculus

    Publication Year: 1988, Page(s):91 - 101
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Given a finite set T identical to (T/sub 1/, . . . ,T/sub t/) of terms of the lambda - beta -K-calculus and a set X/sub T/ identical to (x/sub 1/, . . ., x/sub n/) of free variables (occurring in the elements of T), X/sub T/-separability is the problem of deciding whether there exists a simultaneous substitution for the elements of X/sub T/ transforming T into the set Z identical to (Z/sub 1/, . .... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of the Third Annual Symposium on Logic in Computer Science (Cat. No.88CH2608-8)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (64 KB)
    Freely Available from IEEE
  • Proof-theoretic techniques for term rewriting theory

    Publication Year: 1988, Page(s):104 - 111
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (519 KB)

    A bridge is presented between term-rewriting theory in computer science and proof theory in logic. It is shown that proof-theoretic tools are very useful for analyzing two basic attributes of term rewriting systems, the termination property and the Church-Rosser property. A counterexample is given to show that Knuth's critical pair lemma does not hold for conditional rewrite systems. Two restricti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel algorithms for anti-unification and relative complement

    Publication Year: 1988, Page(s):112 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Parallel algorithms and computational complexity results are given for two problems; computing the relative complement of terms and antiunification. The concepts of antiunification and relative complement are useful for theorem proving, logic programming, and machine learning. The relative complement problem is shown to be NP-complete.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unification in free extensions of Boolean rings and Abelian groups

    Publication Year: 1988, Page(s):121 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 KB)

    A complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrigendum: complete type interference for simple objects

    Publication Year: 1988
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (46 KB)

    An error has been pointed out in the author's paper (see Proc. 2nd IEEE Symp. on Logic in Computer Science, p.37-44 (1987)). It appears that there are programs without principal type schemes in the system in that paper.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the consistency of 'truly concurrent' operational and denotational semantics

    Publication Year: 1988, Page(s):133 - 141
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The problem of the relationship between truly concurrent operational and denotational semantics is tackled by mapping syntactic terms on similar semantic domains in both approaches. Occurrence nets are associated to terms through structural operational semantics based on a set of rewriting rules; event structures are defined as denotations for terms, without resorting to categorical constructions.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A category of labelled Petri nets and compositional proof system

    Publication Year: 1988, Page(s):142 - 154
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1019 KB)

    An attempt is made to cast labeled Petri nets and other models in an algebraic framework. One aim is to utilize the framework of categorical l to cast labeled Petri nets and other models in an algebraic framework. The other aim is to utilize the framework of categorical logic to systematize specification languages and the derivation of proof systems for parallel processes. A category of labeled ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Petri nets are monoids: a new algebraic foundation for net theory

    Publication Year: 1988, Page(s):155 - 164
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (830 KB)

    The composition and extraction mechanisms of Petri nets are at present inadequate. This problem is solved by viewing place/transition Petri nets as ordinary, directed graphs equipped with two algebraic operations corresponding to parallel and sequential composition of transitions. A distributive law between the two operations captures a basic fact about concurrency. Novel morphisms are defined, ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The existence of refinement mappings

    Publication Year: 1988, Page(s):165 - 175
    Cited by:  Papers (24)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    Refinement mappings are used to prove that a lower-level specification correctly implements a higher-level one. The authors consider specifications consisting of a state machine (which may be infinite-state) that specifies safety requirements and an arbitrary supplementary property that specifies liveness requirements. A refinement mapping from a lower-level specification S/sub 1/ to higher-level ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relevance logic and concurrent composition

    Publication Year: 1988, Page(s):178 - 185
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The operation of relativizing properties with respect to parallel environments often used in obtaining compositionality in theories for concurrency corresponds to a notion of (contraction-free) relevant deduction. The author considers program logics in which this notion of deduction is internalized by the corresponding implication. The idea is carried through for safety properties of a simple syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimulations and divergence

    Publication Year: 1988, Page(s):186 - 192
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB)

    Behavioral preorders based on the idea of bisimulation equivalence and providing explicit treatments of the phenomenon of divergence in communicating systems are investigated. Particular study is made of those preorders in the context of R. Milner's (1980) calculus of communicating systems. The precongruence relations generated by the preorders are characterized and axiomated on the classes of fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priorities in process algebras

    Publication Year: 1988, Page(s):193 - 202
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (495 KB)

    An operational semantics for an algebraic theory of concurrency is developed that incorporates a notion of priority into the definition of the execution of actions. An equivalence based on strong observational equivalences is defined and shown to be a congruence, and a complete axiomization is given for finite terms. Several examples highlight the novelty and usefulness of the approaches.<<E... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modal process logic

    Publication Year: 1988, Page(s):203 - 210
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A novel logic is introduced for the introduction of nondeterministic and concurrent processes expressed in a process algebra. For a process algebra to be useful as a process language, it must possess compositionality, i.e. it should be possible to decompose the problem of correctness for a combined system with respect to a given specification of similar and simpler correctness problems for the com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the arithmetic inexpressiveness of term rewriting systems

    Publication Year: 1988, Page(s):212 - 217
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB)

    Unquantified Presburger arithmetic is proved to be nonaxiomatizable by a canonical (i.e. Noetherian and confluent) term-rewriting system, if Boolean connectives are not allowed in the left-hand sides of the rewrite rules. It is conjectured that the same is true if the number of Boolean connectives in left-hand sides of the rules is uniformly bounded by an arbitrary natural number.<<ETX>&g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rigid E-unification is NP-complete

    Publication Year: 1988, Page(s):218 - 227
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB)

    Rigid E-unification is a restricted kind of unification modulo equational theories, or E-unification, that arises naturally in extending P. Andrews' (1981) theorem-proving method of mating to first-order languages with equality. It is shown that rigid E-unification is NP-complete and that finite complete sets of rigid E-unifiers always exist. As a consequence, deciding whether a family of mated se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.