Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Dańko, Wiktor
Affiliations: University of Warsaw, Białystok Division
Abstract: In the paper the following problem stated by Tajtslin in 1979 is investigated: Let A = ⟨ A; f1, …, fn; r1, …, rm ⟩ be a structure. Are there functions f′1, …, f′p and relations r′1, …, r′q definable in A by means of algorithms such that every function relation definable over A by an algorithm is first-order definable in A+ = ⟨ A; f1, …, fn, f′1, …, f′p; r1, …, rm, r′1, …, r′q⟩?
Keywords: algorithms, programmability, logics of programs, algorithmic definability
DOI: 10.3233/FI-1985-8203
Journal: Fundamenta Informaticae, vol. 8, no. 2, pp. 163-197, 1985
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl