"A strict border for the decidability of E-unification for recursive functions"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	2nd ed. 1969	Springer Berlin Heidelberg
Enumerability, decidability, computability. : An introduction to the theory of recursive functions.	Hans Hermes	1969	Springer
Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	1965	Springer Berlin Heidelberg
Enumerability,decidability,computability: an introduction to the theory of recursive functions	Hans Hermes	1965	Springer-Verlag
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems	Roman Murawski	1999	Springer Netherlands
Parallel processing of recursive functions	Franklin Burkhead	1977	Naval Postgraduate School
Algorithms and recursive functions	Anatolii Ivanovič Mal’cev	1970	Wolters-Noordhoff Publishing, Groninge, The Netherlands
Constructions of Strict Lyapunov Functions	Michael Malisoff; Frédéric Mazenc	2009	Springer London
Formal Systems and Recursive Functions	J.N. Crossley; M.A.E. Dummett	1965	Elsevier
Formal Systems and Recursive Functions	J N Crossley, M A E Dummett	1965	Elsevier, Academic Press
Theory of Recursive Functions and Effective Computability	Hartley Rogers	1987	The MIT Press
Theory of recursive functions and effective computability	Hartley Rogers	1967	McGraw-Hill
Theory of recursive functions and effective computability.	H. Rogers	1967	McGraw-Hill
Formal systems and recursive functions: proceedings	Logic Colloquium. (1963 Oxford, Oxfordshire)	1965	North-Holland Pub. Co.
The foundations of intuitionistic mathematics: especially in relation to recursive functions	Stephen Cole Kleene, Richard Eugene Vesley	1965	North-Holland Pub. Co.
The foundations of intuitionistic mathematics: especially in relation to recursive functions	Stephen Cole Kleene	1965	North-Holland Pub. Co.
Some formulas for the products of E-functions and Whittaker functions.	F. M. Ragab	1957	Courant Institute of Mathematical Sciences, New York University
Decidability of Parameterized Verification	Roderick Bloem; Swen Jacobs; Ayrat Kalimov; Igor Konnov		Springer International Publishing
Deducibility and Decidability	R. R. Rockingham Gill	1990	Routledge
Formal Systems and Recursive Functions: Proceedings of the Eighth Logic Colloquium, Oxford, July 1963	John N. Crossley, Michael Dummett (editors)	1965	North-Holland Publishing Company
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
A strict border for the decidability of E-unification for recursive functions	Heinz Faßbender; Sebastian Maneth	Algebraic and Logic Programming: 5th International Conference, ALP ' 96, Aachen, Germany, September 25 - 27, 1996. Proceedings	Michael Hanus; Mario Rodríguez-Artalejo	1996	Springer Berlin Heidelberg
Recursive axiomatization and recursive decidability		Logic: lecture notes	Andrea Iacona	2016
Decidability of Higher-Order Unification	Christian Prehofer	Solving Higher-Order Equations: From Logic to Programming	Christian Prehofer	1998	Birkhäuser Boston
Decidability Properties of Recursive Types	Felice Cardone; Mario Coppo	Theoretical Computer Science: 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings	Carlo Blundo; Cosimo Laneve	2003	Springer Berlin Heidelberg
V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions	Baltasar Trancón y Widemann	Implementation and Application of Functional Languages: 16th International Workshop, IFL 2004, Lübeck, Germany, September 8-10, 2004, Revised Selected Papers	Clemens Grelck; Frank Huch; Greg Michaelson; Phil Trinder	2005	Springer Berlin Heidelberg
166 A Recursive Unification Function		Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th Edition)	George F Luger	2005	Pearson Education Limited
The decidability of simultaneous rigid E-unification with one variable	Anatoli Degtyarev; Yuri Gurevich; Paliath Narendran; Margus Veanes; Andrei Voronkov	Rewriting Techniques and Applications: 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings	Tobias Nipkow	1998	Springer Berlin Heidelberg
Decidability of Bounded Higher-Order Unification	Manfred Schmidt-Schauß; Klaus U. Schulz	Computer Science Logic: 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September	Julian Bradfield	2002	Springer Berlin Heidelberg
Decidability and recursive enumerability for fuzzy subsets	Loredana Biacino; Giangiacomo Gerla	Uncertainty and Intelligent Systems: 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge Based Systems IPMU ' 88. Urbino, Italy, July 4-7, 1988. Proceedings	B. Bouchon; L. Saitta; R. R. Yager	1988	Springer Berlin Heidelberg
1 Partial E-recursive functions		Higher Recursion Theory	Gerald E. Sacks	1990	Springer
Recursive Functions	Luis E. Sanchis	Reflexive Structures: An Introduction to Computability Theory	Luis E. Sanchis	1988	Springer New York
Recursive Functions	Roman Murawski	Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems	Roman Murawski	1999	Springer Netherlands
Recursive functions	Roozbeh Hazrat	Mathematica®: A Problem-Centered Approach	Roozbeh Hazrat	2nd ed. 2015	Springer International Publishing
Recursive functions	Roozbeh Hazrat	Mathematica®: A Problem-Centered Approach	Roozbeh Hazrat	2010	Springer London
Recursive Functions	Maribel Fernández	Models of Computation: An Introduction to Computability Theory	Maribel Fernandez	2009	Springer London
Recursive Functions	S. Krajewski	Dictionary of Logic as Applied in the Study of Language: Concepts/Methods/Theories	W. Marciszewski	1981	Springer Netherlands
Recursive Functions	Hans Hermes	Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	2nd ed. 1969	Springer Berlin Heidelberg
Recursive Functions	Raymond Turner	Computable Models	raymond turner	2009	Springer London
Recursive Functions	Hans Hermes	Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	1965	Springer Berlin Heidelberg
Recursive Functions	Steven G. Krantz	Handbook of Logic and Proof Techniques for Computer Science	Steven G. Krantz	2002	Birkhäuser Boston
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A strict border for the decidability of E-unification for recursive functions" - similar Books and Chapters