Park, David (1974) Finiteness is mu-ineffable. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

HTML WRAP_Park_cs-rr-003.pdf - Published Version Download (1078Kb) | Preview

Request Changes to record.

Abstract

The "mu-calculus"
is
a
formal
system
which
arises
fairly
naturally
when
one
tries
to
extend
predicate
logic
to
formalise
arguments
about
programs.
First-order
predicate
logic
by
itself
is
not
adequate
to
express
interesting
assertions
about
programs
naturally,
even
for
the
most
limited
sorts
of
programming
language,
as
can be seen
from
the
unsolvability
results
of
Luckham,
Park
&
Paterson.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Programming languages (Electronic computers) -- Mathematical models
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	July 1974
Dates:	Date Event July 1974 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 3
Number of Pages:	16
DOI:	CS-RR-003
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Reuse Statement (publisher, data, author rights):	D.M.R. Park, Finiteness is Mu-Ineffable, Theoretical Computer Science 3, pp. 173-181 (1976)
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016
Version or Related Resource:	Park, D.M.R. (1976). Finiteness is mu-ineffable. Theoretical Computer Science, 3, pp. 173-181.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads