Filters








1,128 Hits in 4.5 sec

Page 4202 of Mathematical Reviews Vol. , Issue 80K [page]

1980 Mathematical Reviews  
Finally, the author defines a notion of effectively negatively defined properties of r.e. sets and gives as examples the complete creative sets and the effectively inseparable pairs of sets.  ...  A. "80k :03042 Retracts of Post’s numbering and effectivization of quantifiers. Essays on mathematical and philosophical logic (Proc.  ... 

Extendability of simplicial maps is undecidable [article]

A. Skopenkov
2022 arXiv   pre-print
We also exhibit a gap in the Filakovský-Wagner-Zhechev proof that embeddability of complexes is undecidable in codimension >1.  ...  For any fixed even l there is no algorithm recognizing the extendability of the identity map of S^l to a PL map X→ S^l of given 2l-dimensional simplicial complex X containing a subdivision of S^l as a  ...  The idea of their proof is a reduction to the 'retractability is undecidable' Theorem 1.1.  ... 
arXiv:2008.00492v2 fatcat:dudz2ns4yfevpndozbhj2eqlh4

Page 1779 of Mathematical Reviews Vol. , Issue 92c [page]

1992 Mathematical Reviews  
We use some of the definitions and results of An. A. Muchnik.” 92d:03033 03D35 03C13 05C99 60C05 Spencer, Joel (1-NY-X) Undecidable probabilities.  ...  [c-degrees], and there exist both bc- and bd-degrees which contain infinite antichains of r.e. 1-degrees.  ... 

Page 1779 of Mathematical Reviews Vol. , Issue 92d [page]

1992 Mathematical Reviews  
We use some of the definitions and results of An. A. Muchnik.” 92d:03033 03D35 03C13 05C99 60C05 Spencer, Joel (1-NY-X) Undecidable probabilities.  ...  [c-degrees], and there exist both bc- and bd-degrees which contain infinite antichains of r.e. 1-degrees.  ... 

Equations in Algebras [article]

Olga Kharlampovich, Alexei Myasnikov
2016 arXiv   pre-print
We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups  ...  , including toral relatively hyperbolic groups, right angled Artin groups, commutative transitive groups, the fundamental groups of various graph groups, etc.  ...  A survey of the results on the undecidability of existential theories of rings and fields is given in [19] . Let A K (A) be a free associative algebra with basis A over a field K.  ... 
arXiv:1606.03617v2 fatcat:fwupmojyjbb5fbycctgesd4gnq

SPM Bulletin 14 [article]

Boaz Tsaban
2005 arXiv   pre-print
problems in continuum theory; Residuality of families of F_sigma sets; First countable, countably compact spaces and the continuum hypothesis; Game approach to universally Kuratowski-Ulam spaces; Small  ...  ; The complexity of recursion theoretic games; Cosmic dimension; There is no categorical metric continuum; On a conjecture and a problem of Hurewicz; Problem of the Issue.  ...  We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees.  ... 
arXiv:math/0509432v1 fatcat:mmekipstybdxrcbzf5yylhrvrq

Algorithmic aspects of immersibility and embeddability [article]

Fedor Manin, Shmuel Weinberger
2018 arXiv   pre-print
As a corollary, we show that the smooth embeddability of an m-manifold with boundary in R^n is undecidable when n-m is even and 11m ≥ 10n+1.  ...  We analyze an algorithmic question about immersion theory: for which m, n, and CAT=Diff or PL is the question of whether an m-dimensional CAT-manifold is immersible in R^n decidable?  ...  Questions of immersibility and embeddability are classically handled by reducing them first to pure homotopy theory and then reducing the homotopy theory to algebra.  ... 
arXiv:1812.09413v1 fatcat:tgnfrmrkfjcmzcewdibzd2m2ye

On Q

Albert Visser
2016 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
This tells us that we cannot do much better than mutual faithful interpretability as a measure of sameness of Q and PA − .  ...  We briefly consider the idea of characterizing Q as the minimal-in-some-sense theory of some kind modulo some equivalence relation. We show that at least one possible road towards this aim is closed.  ...  Acknowledgements We thank Victor Pambuccian for his comments We find that K • N 0 is parameter-free and (K • N 0 ) (K • N ). On the other hand, K • N is equal in the sense of  ... 
doi:10.1007/s00500-016-2341-5 fatcat:qodt2e5o6vfgpf7cyoi4ck5kry

Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations [chapter]

Gonzalo A. Aranda-Corral, Joaquín Borrego-Díaz, M. Magdalena Fernández-Lebrón
2009 Lecture Notes in Computer Science  
We present a specialised (polynomial-based) rule for the propositional logic called the Independence Rule, which is useful to compute the conservative retractions of propositional logic theories.  ...  In this paper we show the soundness and completeness of the logical calculus based on this rule, as well as other applications.  ...  This is the first tool designed for effectively computing conservative retractions.  ... 
doi:10.1007/978-3-642-02614-0_9 fatcat:yb4nqv632rgjtjbsnv7slu3rp4

KIENBÖCH'S DISEASE OF THE SEMILUNAR BONE

RALPH GOLDSMITH
1925 Annals of Surgery  
There is slight swelling of the carpus. Limitation of flexion and extension is noted in about equal degree. No limitation of ulnar or radial flexion: no retraction of third metacarpal head.  ...  In established and advanced cases, treatment depends upon the degree of disability. Opera- tion is indicated if there is a very troublesome degree of discomfort and weakness.  ... 
doi:10.1097/00000658-192504000-00015 pmid:17865244 fatcat:zrgaldi3hvaetc4yi7x33637xm

Extendability of Continuous Maps Is Undecidable

Martin Čadek, Marek Krčál, Jiří Matoušek, Lukáš Vokřínek, Uli Wagner
2013 Discrete & Computational Geometry  
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity.  ...  Moreover, either the target space Y or the pair (X, A) can be fixed in such a way that the problem remains undecidable.  ...  of effective homology developed earlier by Sergeraert et al.  ... 
doi:10.1007/s00454-013-9551-8 fatcat:teniqqseendlzfv63spj5daqx4

Extendability of continuous maps is undecidable [article]

Martin Cadek, Marek Krcal, Jiri Matousek, Lukas Vokrinek, Uli Wagner
2013 arXiv   pre-print
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity.  ...  Moreover, either the target space Y or the pair (X,A) can be fixed in such a way that the problem remains undecidable.  ...  of effective homology developed earlier by Sergeraert et al.  ... 
arXiv:1302.2370v1 fatcat:7bv66lfebrc2vfrphjmzfqs4se

Focus Group Evaluation from the Perspective of Program Implementers: Findings Based on the Secondary 2 Program

Daniel T. L. Shek, Rachel C. F. Sun, Christina Y. P. Tang
2009 The Scientific World Journal  
In conjunction with the previous research findings, the present study provides further support for the effectiveness of the Tier 1 Program of Project P.A.T.H.S. in promoting holistic development among  ...  The program implementers also described the program positively and positive metaphors were used to represent the program.  ...  As an exemplary youth development program emphasizing the importance of evidence-based practice, the Tier 1 Program of the Project P.A.T.H.S. was systematically designed based on sound theories and research  ... 
doi:10.1100/tsw.2009.117 pmid:19802493 pmcid:PMC5823150 fatcat:wd4nuw4gync33ox32qyt3ukdie

Intrinsic and Extrinsic Factors Important to Manual Therapy Competency Development: A Delphi Investigation

Phillip PT Sizer, Steven Sawyer, Virginia Felstehausen, Sue Couch, Lanie Dornier, Chad Cook
2008 Journal of Manual & Manipulative Therapy  
The majority of the factors distill into the theory of extrinsic and intrinsic factors identified by Schmidt and Lee.  ...  The purposes of this study were to identify the factors that influence learners' development of manual physical therapy competencies and to define each factor as intrinsic or extrinsic.  ...  mobilization changes as the scapula swings upwards and retracts.  ... 
doi:10.1179/jmt.2008.16.1.9e pmid:19119378 pmcid:PMC2565082 fatcat:equj6b3hfzg6rhvvsp5xicmv5a

Defeasible Reasoning and Argument-Based Systems in Medical Fields: An Informal Overview

Luca Longo, Pierpaolo Dondio
2014 2014 IEEE 27th International Symposium on Computer-Based Medical Systems  
Finally, the paper will conclude with a summary of the features, which make defeasible reasoning and argumentation theory attractive, that emerge from the applications under review.  ...  The first aim of this article is to provide readers informally with the basic notions of defeasible and non-monotonic reasoning, logics borrowed from artificial intelligence.  ...  A tree of these rules can form an argument and a numeric degree of belief is attached to each of them (1 for strict arguments, a partial degree (< 1) for defeasible arguments).  ... 
doi:10.1109/cbms.2014.126 dblp:conf/cbms/LongoD14 fatcat:5zv7pkwyunfvzassja4yn5n4ra
« Previous Showing results 1 — 15 out of 1,128 results