Sciweavers

662 search results - page 20 / 133
» Formalizing Basic First Order Model Theory
Sort
View
CCE
2008
13 years 7 months ago
Structured modeling for processes: A thermodynamical network theory
We review the use of bond graphs for modeling of physico-chemical processes. We recall that bond graphs define a circuit-type language which root on a thermodynamical consistent d...
Françoise Couenne, Christian Jallut, Bernha...
CSL
2007
Springer
13 years 11 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
WER
2010
Springer
13 years 5 months ago
A Tool for Formal Feature Modeling Based on BDDs and Product Families Algebra
Feature models are commonly used to capture the commonality and the variability of product families. There are several feature model notations that correspondingly depict the conce...
Fadil Alturki, Ridha Khedri
TARK
1998
Springer
13 years 11 months ago
Conditional, Hierarchical, Multi-Agent Preferences
We develop a revealed-preferencetheory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by D...
Pierfrancesco La Mura, Yoav Shoham
APAL
2006
45views more  APAL 2006»
13 years 7 months ago
On properties of theories which preclude the existence of universal models
We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality whe...
Mirna Dzamonja, Saharon Shelah