找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: An Algebraic Introduction to Mathematical Logic; Donald W. Barnes,John M. Mack Textbook 1975 Springer Science+Business Media New York 1975

[复制链接]
楼主: Corticosteroids
发表于 2025-3-27 00:32:33 | 显示全部楼层
Erbliche und nichterbliche Eigenschaften,odel of the system to be studied, and then conduct what is essentially a pure mathematical investigation of the properties of our model. Since this book is intended for mathematicians, the system we propose to study is not general logic but the logic used in mathematics. By this restriction, we achi
发表于 2025-3-27 05:07:07 | 显示全部楼层
发表于 2025-3-27 07:03:55 | 显示全部楼层
Die Entstehung neuer Erbeigenschaften,onstructed within the first-order predicate calculus will be called a first-order theory. By comparing a first-order theory with the informal theory on which it is modelled, we may gain insight into the influence of our logical system on our mathematics.
发表于 2025-3-27 09:50:05 | 显示全部楼层
Die Vererbungsgesetze und der Mensch,s must include some form of set theory, for otherwise our study must be restrictive. For example, Elementary Group Theory formalises almost nothing of group theory. The pervasive role of set theory in mathematics implies that any reasonable model of set theory will in effect contain a model of all o
发表于 2025-3-27 15:51:30 | 显示全部楼层
发表于 2025-3-27 17:48:17 | 显示全部楼层
https://doi.org/10.1007/978-3-662-02181-1e complex numbers, each of which is regarded as a unique system. When we attempt to study one of these systems by axiomatising it within the first-order predicate calculus, we find that our axiomatisation cannot be categorical, and that there exist models of our axiomatic theory not isomorphic to th
发表于 2025-3-28 00:04:31 | 显示全部楼层
https://doi.org/10.1007/978-3-642-47386-9d that no such procedure exists for Pred(., .). Before attempting to prove this non-existence theorem, we must say more precisely what we mean by “procedure”. The procedures we shall discuss are called decision processes, and informally we think of a decision process as a list of instructions which
发表于 2025-3-28 02:09:34 | 显示全部楼层
E. Blanck,F. Giesecke,H. Stremme N.. Accordingly, in order to show that a particular function .:N. → N is recursive, we must construct a Turing machine which computes .. This is a tiresome process, even for functions of relatively simple form, and consequently it is natural to seek an alternative characterisation of recursive func
发表于 2025-3-28 06:42:33 | 显示全部楼层
发表于 2025-3-28 11:45:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-17 20:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表