找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪(fǎng)問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: K?lner Papyri; P. K?ln,B?rbel Kramer,Michael Erler,Robert Hübner Book 1980 Springer Fachmedien Wiesbaden 1980 Apollon.Augustus.Geld.Griech

[復(fù)制鏈接]
樓主: 忠誠(chéng)
21#
發(fā)表于 2025-3-25 07:18:59 | 只看該作者
Gestellungsbürgschaften, und zwar das obere Fragment a an der Unterkante, das untere Fragment b an der Oberkante; dadurch fehlen zwischen beiden Stücken mehrere Zeilen. Auf Fr. a sind Teile des oberen und des linken Freirandes erhalten, die beide etwa 2 cm in der H?he bzw. der Breite messen; auf Fr. b ist nur der linke
22#
發(fā)表于 2025-3-25 09:45:41 | 只看該作者
Anzeige eines Viehdiebstahlserechte Faltspuren und zus?tzlich durch Abbl?ttern der Oberfl?che gelitten, doch ist der Text fast vollst?ndig rekonstruierbar. Nur die oberen 10 cm des Blattes sind beschrieben, also weniger als die H?lfte. Zwei H?nde lassen sich unterscheiden; die erste, aber wohl sp?tere Hand (Z. 1–7) hat sehr fl
23#
發(fā)表于 2025-3-25 13:14:30 | 只看該作者
esearch problem. In this paper we consider WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs. We focus on multi-sequential WA that are defined as finite unions of sequential WA. The problem we address is to minimize the size of this union. We call t
24#
發(fā)表于 2025-3-25 18:43:38 | 只看該作者
B?rbel Kramer,Michael Erler,Dieter Hagedorn,Robert Hübneremporal logic of “repeating values” (LRV) featuring an operator which tests whether a data value in the current node is repeated in some descendant node..On the one hand, we show that the satisfiability of a restricted version of LRV on ranked data trees can be reduced to the coverability problem fo
25#
發(fā)表于 2025-3-25 21:52:52 | 只看該作者
26#
發(fā)表于 2025-3-26 00:55:25 | 只看該作者
B?rbel Kramer,Michael Erler,Dieter Hagedorn,Robert Hübnerrouwer as an axiom to recover certain classically valid theorems in a constructive setting. It is a form of induction on non-wellfounded trees satisfying certain properties. Bar recursion, introduced later by Spector, is the corresponding function definition principle..We give a generalization of th
27#
發(fā)表于 2025-3-26 05:36:34 | 只看該作者
B?rbel Kramer,Michael Erler,Dieter Hagedorn,Robert Hübnerrouwer as an axiom to recover certain classically valid theorems in a constructive setting. It is a form of induction on non-wellfounded trees satisfying certain properties. Bar recursion, introduced later by Spector, is the corresponding function definition principle..We give a generalization of th
28#
發(fā)表于 2025-3-26 11:21:51 | 只看該作者
B?rbel Kramer,Michael Erler,Dieter Hagedorn,Robert Hübnereled as coalgebras with a finitely generated carrier for an endofunctor on a locally finitely presentable category. Their behaviour gives rise to a new fixpoint of the coalgebraic type functor called . (LFF). We prove that if the given endofunctor preserves monomorphisms then the LFF always exists a
29#
發(fā)表于 2025-3-26 16:25:46 | 只看該作者
30#
發(fā)表于 2025-3-26 20:39:51 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 08:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
托里县| 康定县| 涿鹿县| 马龙县| 丰宁| 临安市| 都安| 嘉善县| 塘沽区| 伊通| 滕州市| 浦江县| 建德市| 庆阳市| 绥阳县| 临邑县| 云和县| 临夏县| 南丹县| 顺昌县| 宁夏| 汪清县| 泾源县| 河津市| 郁南县| 东港市| 剑阁县| 葫芦岛市| 阳西县| 涞水县| 泰兴市| 三门峡市| 仲巴县| 桃园县| 安图县| 北京市| 静海县| 阜城县| 都兰县| 十堰市| 讷河市|