咨询与建议

限定检索结果

文献类型

  • 836 篇 期刊文献
  • 438 篇 会议
  • 86 册 图书
  • 1 篇 学位论文

馆藏范围

  • 1,351 篇 电子文献
  • 10 种 纸本馆藏

日期分布

学科分类号

  • 780 篇 理学
    • 693 篇 数学
    • 57 篇 物理学
    • 43 篇 统计学(可授理学、...
    • 20 篇 系统科学
    • 14 篇 科学技术史(分学科...
    • 13 篇 生物学
    • 11 篇 化学
  • 667 篇 工学
    • 536 篇 计算机科学与技术...
    • 252 篇 软件工程
    • 65 篇 电气工程
    • 53 篇 控制科学与工程
    • 22 篇 电子科学与技术(可...
    • 22 篇 信息与通信工程
    • 12 篇 力学(可授工学、理...
    • 10 篇 机械工程
    • 9 篇 化学工程与技术
    • 8 篇 动力工程及工程热...
    • 6 篇 材料科学与工程(可...
    • 6 篇 建筑学
  • 77 篇 管理学
    • 47 篇 管理科学与工程(可...
    • 24 篇 图书情报与档案管...
    • 6 篇 工商管理
    • 6 篇 公共管理
  • 29 篇 经济学
    • 18 篇 理论经济学
    • 14 篇 应用经济学
  • 24 篇 哲学
    • 20 篇 哲学
  • 12 篇 医学
    • 6 篇 基础医学(可授医学...
    • 6 篇 临床医学
  • 11 篇 法学
    • 11 篇 社会学
  • 8 篇 教育学
    • 5 篇 心理学(可授教育学...
  • 8 篇 农学
  • 6 篇 文学
  • 4 篇 艺术学
  • 1 篇 历史学

主题

  • 1,361 篇 recursive functi...
  • 187 篇 mathematical the...
  • 119 篇 logical theorems
  • 92 篇 recursion
  • 80 篇 algorithms
  • 75 篇 integers
  • 62 篇 recursively enum...
  • 60 篇 natural numbers
  • 57 篇 nasa technical r...
  • 57 篇 (ntrs)
  • 51 篇 degree of unsolv...
  • 46 篇 arithmetic
  • 42 篇 mathematical ind...
  • 34 篇 polynomials
  • 31 篇 recursion theory
  • 31 篇 approximation
  • 31 篇 algebra
  • 27 篇 induction assump...
  • 26 篇 equivalence rela...
  • 23 篇 oracles

机构

  • 7 篇 natl univ singap...
  • 6 篇 univ maryland de...
  • 5 篇 inria
  • 5 篇 univ wisconsin d...
  • 5 篇 univ munster ins...
  • 4 篇 univ kaiserslaut...
  • 4 篇 school of comput...
  • 4 篇 univ calif san d...
  • 4 篇 massachusetts in...
  • 4 篇 rutgers state un...
  • 4 篇 università degli...
  • 3 篇 university of ca...
  • 3 篇 ohio state univ ...
  • 3 篇 mit cambridge ma...
  • 3 篇 institute of mat...
  • 3 篇 univ edinburgh e...
  • 3 篇 univ chicago il ...
  • 3 篇 department of co...
  • 3 篇 univ calif berke...
  • 3 篇 natl univ singap...

作者

  • 11 篇 remmel jb
  • 9 篇 stephan frank
  • 8 篇 jain s
  • 7 篇 jockusch cg
  • 6 篇 zeugmann thomas
  • 6 篇 roversi luca
  • 6 篇 dipaola ra
  • 6 篇 dekker jce
  • 6 篇 jain sanjay
  • 6 篇 wiehagen r
  • 6 篇 kummer m
  • 6 篇 stephan f
  • 5 篇 slaman ta
  • 5 篇 kutrib martin
  • 5 篇 nipkow tobias
  • 5 篇 herrmann e
  • 5 篇 hu zhenjiang
  • 5 篇 downey rg
  • 5 篇 owings jc
  • 5 篇 byerly re

语言

  • 1,303 篇 英文
  • 43 篇 其他
  • 8 篇 法文
  • 3 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 日文
检索条件"主题词=Recursive functions"
1361 条 记 录,以下是81-90 订阅
排序:
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
收藏 引用
JOURNAL OF FUNCTIONAL PROGRAMMING 2022年 第1期32卷 e13-e13页
作者: Danvy, Olivier Natl Univ Singapore Yale NUS Coll Singapore Singapore Natl Univ Singapore Sch Comp Singapore Singapore
Fold-unfold lemmas complement the rewrite tactic in the Coq Proof Assistant to reason about recursive functions, be they defined locally or globally. Each of the structural cases gives rise to a fold-unfold lemma that... 详细信息
来源: 评论
THE CONGRUENCE PROPERTIES OF ROMIK’S SEQUENCE OF TAYLOR COEFFICIENTS OF JACOBI’S THETA FUNCTION θ3
arXiv
收藏 引用
arXiv 2023年
作者: Krattenthaler, Christian Müller, Thomas W. Fakultät für Mathematik Universität Wien Oskar-Morgenstern-Platz 1 ViennaA-1090 Austria
In [Ramanujan J. 52 (2020), 275–290], Romik considered the Taylor expansion of Jacobi’s theta function θ3(q) at q = e−π and encoded it in an integer sequence (d(n))n≥0 for which he provided a recursive procedure ... 详细信息
来源: 评论
ON THE RELATIONSHIPS BETWEEN SOME META-MATHEMATICAL PROPERTIES OF ARITHMETICAL THEORIES
arXiv
收藏 引用
arXiv 2023年
作者: Cheng, Yong
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathem... 详细信息
来源: 评论
Computing functions by Teams of Deterministic Finite Automata
arXiv
收藏 引用
arXiv 2023年
作者: Pattanayak, Debasish Pelc, Andrzej Université du Québec en Outaouais Gatineau Canada
We consider the task of computing functions f : k → , where N is the set of natural numbers, by finite teams of agents modelled as deterministic finite automata. The computation is carried out in a distributed way, u... 详细信息
来源: 评论
Harpoon: Mechanizing Metatheory Interactively  28th
Harpoon: Mechanizing Metatheory Interactively
收藏 引用
28th International Conference on Automated Deduction (CADE)
作者: Errington, Jacob Jang, Junyoung Pientka, Brigitte McGill Univ Montreal PQ Canada
BELUGA is a proof checker that provides sophisticated infrastructure for implementing formal systems with the logical framework LF and proving metatheoretic properties as total, recursive functions transforming LF der... 详细信息
来源: 评论
While Loops in Coq
arXiv
收藏 引用
arXiv 2023年
作者: Nowak, David Rusu, Vlad Univ. Lille CNRS Centrale Lille UMR 9189 CRIStAL LilleF-59000 France Univ. Lille Inria Centrale Lille UMR 9189 CRIStAL LilleF-59000 France
While loops are present in virtually all imperative programming languages. They are important both for practical reasons (performing a number of iterations not known in advance) and theoretical reasons (achieving Turi... 详细信息
来源: 评论
AN INTRODUCTION TO MATHEMATICAL LOGIC
arXiv
收藏 引用
arXiv 2023年
作者: Freund, Anton University of Würzburg Institute of Mathematics Emil-Fischer-Straße 40 Würzburg97074 Germany
This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the Löwenheim-Skolem theorem, Craig ... 详细信息
来源: 评论
Folding interpretations
arXiv
收藏 引用
arXiv 2023年
作者: Bojańczyk, Mikolaj University of Warsaw Poland
We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly the... 详细信息
来源: 评论
A NOTE ON THE DEGREE STRUCTURE OF PRIMITIVE recursive m-REDUCIBILITY
arXiv
收藏 引用
arXiv 2023年
作者: Kalmurzayev, Birzhan S. Bazhenov, Nikolay A. Iskakov, Alibek M. Kazakh-British Technical University 59 Tole Bi Street Almaty050000 Kazakhstan Al-Farabi Kazakh National University 71 al Farabi Avenue Almaty050040 Kazakhstan
Let Cprm be the upper semilattice of degrees of computable sets with respect to primitive recursive m-reducibility. We prove that the first-order theory of Cprm is hereditarily *** Codes 03D30, 03D20 Copyright © ... 详细信息
来源: 评论
CATEGORICAL STRUCTURE IN THEORY OF ARITHMETIC
arXiv
收藏 引用
arXiv 2023年
作者: Ye, Lingyuan ILLC University of Amsterdam Netherlands
In this paper, we provide a categorical analysis of the arithmetic theory I Σ1. We will provide a categorical proof of the classical result that the provably total recursive functions in I Σ1 are exactly the primiti... 详细信息
来源: 评论