Computable Models

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Computable models pervade present day science and engineering and are implicit in the specification of software systems. Raymond Turner first provides a logical framework for specification and the design of specification languages, then uses this framework to introduce and study computable models. In doing so he presents the first systematic attempt to provide computable models with a logical foundation.

Computable models have wide-ranging applications from programming language semantics and the definition of specification languages, through to knowledge representation languages and formalisms for natural language semantics. They are also implicit in the computer modelling employed in many areas of science and engineering.

This detailed investigation into the logical foundations of specification and its application to the construction of computable models should be of interest to a wide range of researchers including graduate students in mathematical logic and computer science.

Author(s): Raymond Turner
Publisher: Springer
Year: 2009

Language: English
Pages: 238
Tags: Language Translation and Linguistics; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Computation by Abstract Devices; Theory of Computation

Front Matter....Pages 1-9
What is a Computable Model?....Pages 1-9
Typed Predicate Logic....Pages 1-14
Data Types....Pages 1-12
Definability....Pages 1-6
Specification....Pages 1-10
Functions....Pages 1-10
Preconditions....Pages 1-8
Natural Numbers....Pages 1-14
Typed Set Theory....Pages 1-18
Systems Modeling....Pages 1-9
A Type of Types....Pages 1-13
Schemata....Pages 1-15
Separation Types....Pages 1-11
Recursive Schemata....Pages 1-12
Inductive Types....Pages 1-9
Recursive Functions....Pages 1-7
Schema Definitions....Pages 1-10
Computable Ontology....Pages 1-5
Classes....Pages 1-5
Classes of Functions....Pages 1-9
Computable Analysis....Pages 1-6
Programming Language Specification....Pages 1-7
Abstract Types....Pages 1-6
Conclusion....Pages 1-1
Back Matter....Pages 1-2