A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Towards a synthesis of data-based and theory-based models of environmental systems
2006
Water Science and Technology
Preserved Fulltext
and parameter estimation of the theory-based models. ...
Recursive methods of time-series analysis are used to identify the data-based models and companion recursive methods, specifically the Recursive Prediction Error algorithm, are employed for structure identification ...
and parameter estimation of the theory-based models. ...
doi:10.2166/wst.2006.012
pmid:16532740
fatcat:cvhamwwmd5fapiu2vbhrijvkdy
CIRCULARITY IN SOUNDNESS AND COMPLETENESS
2014
Bulletin of Symbolic Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Introduction The Soundness Theorem The Completeness Theorem Towards an analysis of completeness Conclusions
Example from set theory There is a model of set theory containing an abelian group A with Ext ...
Σ Rec ⊥ for many Σ, since there are recursive models. All rules for first order logic are sound, since Σ σ implies Σ Rec σ. ...
(This can be arranged to get a completion of the theory, or a full description of a model.) ...
doi:10.1017/bsl.2013.4
fatcat:efudec6w7nefjlmkt2myssxlcq
Page 8455 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In model theory there are papers by Vaught (on the number of countable models up to isomorphism of a countable complete theory), Morley (the categoricity theorem), Shelah (stability theory), Zil’ber (on ...
Solovay, A model of set-theory in which every set of reals is Lebesgue measurable [; MR 42 #64] (480— 535); Clifford Spector, On degrees of recursive unsolvability [; MR 18,552d] (536-546); Alfred Tarski ...
Page 632 of Mathematical Reviews Vol. , Issue 91B
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
I. (2-KEME) Towards the structural stability theory. Logic, methodology and philosophy of science, VIII (Moscow, 1987), 163-175, Stud. Logic Found. ...
From the text (of the translation journal): “In this note the elemen- tary theories of the classes of groups of recursive permutations, groups of recursive automorphisms of constructive models, and constructivizable ...
Page 6799 of Mathematical Reviews Vol. , Issue 2000j
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
structural theories of finite-state machines (Krohn-Rhodes theory) and databases (Galois theory of databases), and beyond toward the structure of algorithms. ...
The author investigates the primitive beginnings of a structural theory of algorithms; i.e., the evolutional transitions from the structural theory of algebraic objects (groups, rings, modules) toward ...
Author index to volumes 1–10
1976
Annals of Mathematical Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Blass, Aa axiomatic approach to rank in model theory Barwise, J., Absolute logics and L.", Barwise, J., Axioms ,tor abstract model theory Barwise, J., and P. ...
Lerman, Hyperhypersimple a-r.e. sets Cooper, S.B., Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 Cutland, N., Model theory on admissible sets Dawson, Jr., J.W., ...
Smorynski, Kripke models and"the intuitionistic theory of species 9 Jockusch, Jr., C.G., and S.G. ...
doi:10.1016/0003-4843(76)90014-0
fatcat:fspzfmruhzbjxooplbh22p6jwm
A case for satisfaction classes: model theoretic vs axiomatic approaches to the notion of truth
2013
Logical Investigations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Satisfaction classes are often described as complicated model theoretic constructions unable to give useful information toward the notion of truth from a general point of view. ...
For example, does the expressive power of a language change or does the proof strength of a theory increase? ...
A non-recursively saturated model O is a model where at least one recursive type (a recursive set P (x) of formulas) is not realized in O. ...
doi:10.21146/2074-1472-2013-19-0-246-259
fatcat:uc6pefouxngyjokzaxcd2trvja
Towards a theory of abstract data types: A discussion on problems and tools
[chapter]
1980
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper aims to show that, in order to capture a quite relevant feature such as the recursiveness of abstract data types, Model Theory works better than Category Theory. ...
countable models. ...
isoinitial model of any axiomatizable theory (if it exists) is recursive). ...
doi:10.1007/3-540-09981-6_4
fatcat:vqke4bgb7bbkhltzioe4utian4
Page 5959 of Mathematical Reviews Vol. , Issue 97J
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The introduction states: “The purpose of this paper is to exam- ine the meaning, origin, and history of the concepts ‘recursion’ and ‘computable’ with an eye towards re-examining how we use them in practice ...
It gives a historical account, and focuses upon how the name “recursion theory” came to be associated with clas- sical computability theory. ...
Page 262 of Communication Abstracts Vol. 19, Issue 2
[page]
1996
Communication Abstracts
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Toward a recursive theory, the author adds two propositions for understanding communication and articulates a few of its corollaries. ...
A recursive theory of communication. Crowley, D. and Mitchell, D., eds. Communication theory today. Stanford, CA: Stanford Univer- sity Press, 1994, pp. 78-104.
COMMUNICATION THEORY. ...
Page 1554 of Mathematical Reviews Vol. 58, Issue 3
[page]
1979
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Makowsky (Jerusalem)
58 + 10398
Schlipf, John Stewart
Toward model theory through recursive saturation.
J. Symbolic Logic 43 (1978), no. 2, 183-206. ...
The value of recursively saturated and resplendent models lies in their abundance (any consistent theory having infinite models has resplendent models in all cardinalities) and the fact that they possess ...
Recola2: a one-loop matrix-element generator for BSM theories and SM effective field theory
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present the Recola2 library for the efficient generation and computation of one-loop amplitudes in Beyond-Standard-Model theories. ...
Recola2 is able to operate with non-trivial extensions of the SM, e.g. extended Higgs sectors and effective field theories. ...
Thus, one step towards the evaluation of (3.1) for generic theories is to compute the rational terms of type R 2 and the counterterms for each model file once and for all. ...
arXiv:1712.04754v1
fatcat:yie6ix2vfvhx5dbta3cxtgilt4
Page 6027 of Mathematical Reviews Vol. , Issue 2000i
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Ever since the formulation of the BSS model of real computation by Blum, Shub and Smale, researchers have looked towards the classical recursion, or computability, theory for inspiration and contrasts. ...
The classical notion of Kleene is that of higher type recursion theory, where the input and output have infinite representations of reals, whereas in the BSS model one has reals as basic atomic objects ...
Three aspects of super-recursive algorithms and hypercomputation or finding black swans
2004
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These new models are more powerful than the classical recursive algorithm models, i.e., Turing machines, partial recursive functions, Lambda-calculus, and cellular automata. ...
New mathematical models for algorithms and computation have appeared that extend prior theory in a manner similar to the way relativity theory and quantum mechanics went beyond Newtonian mechanics. ...
The new area of computer science called the theory of super-recursive algorithms and hypercomputation consists of several directions. The most important ones are ...
doi:10.1016/j.tcs.2003.12.001
fatcat:3cktjqxgqvanfmej3mfrkr7e2a
Three aspects of super-recursive algorithms and hypercomputation or finding black swans
2004
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These new models are more powerful than the classical recursive algorithm models, i.e., Turing machines, partial recursive functions, Lambda-calculus, and cellular automata. ...
New mathematical models for algorithms and computation have appeared that extend prior theory in a manner similar to the way relativity theory and quantum mechanics went beyond Newtonian mechanics. ...
The new area of computer science called the theory of super-recursive algorithms and hypercomputation consists of several directions. The most important ones are ...
doi:10.1016/s0304-3975(03)00628-5
fatcat:nvqegz24ifbmnp3tk7c4bl5nge
« Previous
Showing results 1 — 15 out of 137,361 results