Marian Boykan Pour-El

From MaRDI portal
Person:1054722



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computability in analysis and physics2017-07-06Paper
scientific article; zbMATH DE number 1746031 (Why is no real title available?)2002-05-27Paper
scientific article; zbMATH DE number 1390023 (Why is no real title available?)2000-10-08Paper
From axiomatics to intrinsic characterization: some open problems in computable analysis
Theoretical Computer Science
1999-06-21Paper
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
Mathematical Logic Quarterly
1997-11-18Paper
scientific article; zbMATH DE number 42077 (Why is no real title available?)1992-09-17Paper
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
Advances in Mathematics
1987-01-01Paper
L p -Computability in Recursive Analysis
Proceedings of the American Mathematical Society
1984-01-01Paper
Computability and Noncomputability in Classical Analysis1983-01-01Paper
Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
Advances in Mathematics
1983-01-01Paper
Noncomputability in models of physical phenomena
International Journal of Theoretical Physics
1982-01-01Paper
The wave equation with computable initial data such that its unique solution is not computable
Advances in Mathematics
1981-01-01Paper
A computable ordinary differential equation which possesses no computable solution
Annals of Mathematical Logic
1979-01-01Paper
scientific article; zbMATH DE number 3616422 (Why is no real title available?)1978-01-01Paper
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
Mathematical Logic Quarterly
1975-01-01Paper
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)1974-01-01Paper
scientific article; zbMATH DE number 3427338 (Why is no real title available?)1973-01-01Paper
Axiomatizable theories with few axiomatizable extensions
Journal of Symbolic Logic
1970-01-01Paper
A Recursion-theoretic View of Axiomatizable Theories
Dialectica
1970-01-01Paper
Independent Axiomatization and its Relation to the Hypersimple Set
Mathematical Logic Quarterly
1968-01-01Paper
Effectively extensible theories
Journal of Symbolic Logic
1968-01-01Paper
Deduction-preserving "Recursive Isomorphisms" between theories
Fundamenta Mathematicae
1967-01-01Paper
Deduction-preserving “recursive isomorphisms” between theories
Bulletin of the American Mathematical Society
1967-01-01Paper
Recursively enumerable classes and their application to recursive sequences of formal theories
Archiv für Mathematische Logik und Grundlagenforschung
1965-01-01Paper
“Recursive isomorphism” and effectively extensible theories
Bulletin of the American Mathematical Society
1965-01-01Paper
Godel Numberings Versus Friedberg Numberings
Proceedings of the American Mathematical Society
1964-01-01Paper
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
Mathematical Logic Quarterly
1964-01-01Paper
A Comparison of Five “Computable” Operators
Mathematical Logic Quarterly
1960-01-01Paper


Research outcomes over time


This page was built for person: Marian Boykan Pour-El