Results 81 to 90 of about 10,214,423 (243)
Anselm's Temporal‐Ontological Proof
Noûs, EarlyView.ABSTRACT In his Reply to Gaunilo, Anselm presented two additional arguments for the existence of God beyond those that appear in the Proslogion. In “The Logical Structure of Anselm's Argument,” Robert M. Adams isolates each. One, he develops into a modal ontological argument along the lines of other 20th century ontological arguments (e.g., those of ...
Daniel Rubio
wiley +1 more source
METHODS AND MODELS TO RESEARCH THE VIRTUAL MANUFACTURES ORIENTED ON THE ISSUE OF HIGH-TECH PRODUCTS
Авіаційно-космічна техніка та технологія, 2017 The problem to create the virtual manufacturing system (VMS) for the manufacture of high-tech products (aeronautics, automotive, instrumentation, etc.) is stated and solved.
Олег Евгеньевич Федорович +2 more
doaj +1 more source
‘Chrystalline Talk’: Thomas Browne's Poetics of Concretion and Mineral Plain Style
Renaissance Studies, EarlyView.ABSTRACT This article charts the figuration, both material and rhetorical, of mineral bodies in early modern natural philosophy, paying particular attention to the second book of Thomas Browne's Pseudodoxia Epidemica (1646). It argues that concretions (stony calculi and crystals formed through the aggregation of physical matter) make manifest a mineral
Jess Dunmore
wiley +1 more source
How Well Can Words Capture Facial Appearance? A Cross‐Linguistic Exploration
Topics in Cognitive Science, EarlyView.Abstract When describing faces, people often struggle with verbalizing facial features. Free descriptions seem to focus predominantly on aspects of faces that are inferred, for example, psychological traits, age, attractiveness, and so on, whereas facial features themselves are often described in a limited and imprecise fashion.
Ewelina Wnuk, Jan Wodowski
wiley +1 more source
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science, 2005 A complete bipartite set \(B\) of a graph is a subset of vertices admitting a bipartition \(B=X\cup Y\) such that both \(X\) and \(Y\) are independent sets and all vertices of \(X\) are adjacent to those of \(Y\). If both \(X,Y\neq \emptyset\), then \(B\) is called proper. A biclique is a maximal proper complete bipartite set of a graph.
Vânia M. Félix Dias +2 more
openaire +2 more sources
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
, 2021 У раду се анализира лексикографскa обрадa вишечланих лексичких јединица у Речнику славеносрпског језика. На примеру Речника САНУ, указује се на методолошка начела којима се руководе лексикографи описних речника приликом обраде оваквих форми, а потом се
Мацановић, Ана З.
core
The passion of butterflies: Notes on “translating” a Navajo poem by Rex Lee Jim
Journal of Linguistic Anthropology, Volume 36, Issue 2, August 2026.Abstract This essay honors three kinds of tradition. The first tradition is the poetry of Rex Lee Jim. The second tradition is the translation work of Blackhorse Mitchell. The third tradition is the discourse‐centered and ethnopoetic tradition of linguistic anthropology. I do this by focusing on a brief poem in Navajo by Rex Lee Jim.
Anthony K. Webster
wiley +1 more source
Lexikos, 2016 This paper initially discusses some of the consequences which the technological development has for lexicography, especially in terms of the different types of empirical basis which can be used in dictionary projects.
Sven Tarp
doaj +1 more source
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
Journal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák +1 more
wiley +1 more source