✦ LIBER ✦

Union of logics modeled by finite trees

✍ Scribed by Ya. M. Drugush

Publisher: Springer US
Year: 1982
Tongue: English
Weight: 654 KB
Volume: 21
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01980750

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite Models of Some Substructural Logi

Finite Models of Some Substructural Logics

✍ Wojciech Buszkowski 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

Computing finite models by reduction to

Computing finite models by reduction to function-free clause logic

✍ Peter Baumgartner; Alexander Fuchs; Hans de Nivelle; Cesare Tinelli 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Recent years have seen considerable interest in procedures for computing finite models of first-order logic specifications. One of the major paradigms, MACE-style model building, is based on reducing model search to a sequence of propositional satisfiability problems and applying (efficient) SAT sol

Anatomical Variability and Functional Ab

Anatomical Variability and Functional Ability of Vascular Trees Modeled by Constrained Constructive Optimization

✍ Wolfgang Schreiner; Friederike Neumann; Martin Neumann; Adelheid End; Susanne M. 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The aim of this study was to investigate the extent that functional capability of vascular trees is related to anatomical variability. To these ends we used the method of Constrained Constructive Optimization (CCO) to generate optimized computer models of coronary arterial trees. All these model tre

Automated verification of responsive pro

Automated verification of responsive protocols modeled by extended finite state machines

✍ Yoshiaki Kakuda; Tohru Kikuno; Kenichi Kawashima 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 940 KB

Logical Complexity of Some Classes of Tr

Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata

✍ Wojciech Buszkowski 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ

On random models of finite power and mon

On random models of finite power and monadic logic

✍ Matt Kaufmann; Saharon Shelah 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 619 KB

For any property d~ of a model (or graph), let ~n(&) be the fraction of models of power n which satisfy &, and let ~(d~) = lim~\_\_~ Izn(d)) if this limit exists. For first-order properties &, it is known that ~(&) must be 0 or 1. We answer a question of K. Compton by proving in a strong way that th