Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Computable functions. --- Model theory. --- Engineering & Applied Sciences --- Computer Science --- Computable functions --- Model theory --- Mathematical Theory --- Mathematics --- Physical Sciences & Mathematics --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Computer science. --- Computers. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computational linguistics. --- Computer Science. --- Theory of Computation. --- Computation by Abstract Devices. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Artificial Intelligence (incl. Robotics). --- Language Translation and Linguistics. --- Logic, Symbolic and mathematical --- Constructive mathematics --- Decidability (Mathematical logic) --- Information theory. --- Logic design. --- Natural language processing (Computer science). --- Artificial Intelligence. --- Natural Language Processing (NLP). --- NLP (Computer science) --- Artificial intelligence --- Electronic data processing --- Human-computer interaction --- Semantic computing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This text grew out of graduate level courses in mathematics, engineering and physics given at several universities. The courses took students who had some background in differential equations and lead them through a systematic grounding in the theory of Hamiltonian mechanics from a dynamical systems point of view. Topics covered include a detailed discussion of linear Hamiltonian systems, an introduction to variational calculus and the Maslov index, the basics of the symplectic group, an introduction to reduction, applications of Poincaré's continuation to periodic solutions, the use of normal forms, applications of fixed point theorems and KAM theory. There is a special chapter devoted to finding symmetric periodic solutions by calculus of variations methods. The main examples treated in this text are the N-body problem and various specialized problems like the restricted three-body problem. The theory of the N-body problem is used to illustrate the general theory. Some of the topics covered are the classical integrals and reduction, central configurations, the existence of periodic solutions by continuation and variational methods, stability and instability of the Lagrange triangular point. Ken Meyer is an emeritus professor at the University of Cincinnati, Glen Hall is an associate professor at Boston University, and Dan Offin is a professor at Queen's University.

Hamiltonian systems. --- Many-body problem. --- Nonlinear theories. --- Nucleon-nucleon scattering. --- Hamiltonian systems --- Many-body problem --- Mathematics --- Physical Sciences & Mathematics --- Calculus --- Geometry --- n-body problem --- Problem of many bodies --- Problem of n-bodies --- Hamiltonian dynamical systems --- Systems, Hamiltonian --- Edinburgh LCF (Computer system) --- Edinburgh LCF (système informatique) --- -Edinburgh LCF (Computer system) --- 681.3*D24 --- 681.3*F1 --- Edinburgh Logic for Computable Functions (Computer system) --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Decidability (Mathematical logic) --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Computation by abstract devices --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Edinburgh LCF (Computer system). --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F1 Computation by abstract devices --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Mathematics. --- Mathematical analysis. --- Analysis (Mathematics). --- Dynamics. --- Ergodic theory. --- Physics. --- Dynamical Systems and Ergodic Theory. --- Theoretical, Mathematical and Computational Physics. --- Analysis. --- Computer architecture. Operating systems --- Computable functions --- #TCPW:boek --- #TCPW P3.0 --- 681.3*F41 --- Computer systems --- Proof theory --- Recursive functions --- Data processing --- Natural philosophy --- Philosophy, Natural --- Physical sciences --- Dynamics --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- 517.1 Mathematical analysis --- Mathematical analysis --- Math --- Science --- Differentiable dynamical systems --- Data processing. --- Fonctions calculables --- Differentiable dynamical systems. --- Global analysis (Mathematics). --- Analysis, Global (Mathematics) --- Differential topology --- Functions of complex variables --- Geometry, Algebraic --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Computer science. --- Computer Science, general. --- Informatics --- Mathematical physics. --- Physical mathematics