BIRTHDAY 2008 - PDF Preprint Papers

BIRTHDAY 2008 Computation Theory and Logic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed BIRTHDAY-2008 Paper

click to vote

BIRTHDAY
2008
Springer

203views Applied Computing» more BIRTHDAY 2008»

Why Sets?

13 years 6 months ago

Download research.microsoft.com

Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far-away plane...

Andreas Blass

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	203	Why Sets?	claim
2	176	AND/OR Multi-valued Decision Diagrams for Constraint Networks	claim
3	172	Secure Data Flow in a Calculus for Context Awareness	claim
4	165	Unfolding Graph Transformation Systems: Theory and Applications to Verification	claim
5	156	History Dependent Automata for Service Compatibility	claim
6	146	On Natural Non-dcpo Domains	claim
7	141	Some Results on the Expressive Power and Complexity of LSCs	claim
8	139	A Heterogeneous Approach to UML Semantics	claim
9	134	Church's Problem and a Tour through Automata Theory	claim
10	127	What Do Semantics Matter When the Meat Is Overcooked?	claim
11	123	Tree Automata over Infinite Alphabets	claim
12	121	Temporal Verification of Probabilistic Multi-Agent Systems	claim
13	119	Session and Union Types for Object Oriented Programming	claim
14	119	Model Transformation Languages and Their Implementation by Bootstrapping Method	claim
15	117	Checking Temporal Properties of Discrete, Timed and Continuous Behaviors	claim
16	117	Transformations in Reconfigurable Place/Transition Systems	claim
17	117	Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey	claim
18	116	Automatic Mutual Exclusion and Atomicity Checks	claim
19	114	A Category of Explicit Fusions	claim
20	113	From Monadic Logic to PSL	claim
21	108	Approximating Behaviors in Embedded System Design	claim
22	107	The Reaction Algebra: A Formal Language for Event Correlation	claim
23	105	The Pairing of Contracts and Session Types	claim
24	104	Event-Based Service Coordination	claim
25	103	The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed	claim
26	103	SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets	claim
27	103	Graph-Based Design and Analysis of Dynamic Software Architectures	claim
28	101	Linear Recurrence Relations for Graph Polynomials	claim
29	101	Semiring-Based Soft Constraints	claim
30	100	On Partially Wellfounded Generic Ultrapowers	claim
31	97	Observability Concepts in Abstract Data Type Specification, 30 Years Later	claim
32	97	From Domain to Requirements	claim
33	96	Dynamically Evolvable Dependable Software: From Oxymoron to Reality	claim
34	96	A Type System for Client Progress in a Service-Oriented Calculus	claim
35	95	Specifying and Analysing SOC Applications with COWS	claim
36	95	Models of Computation: A Tribute to Ugo Montanari's Vision	claim
37	93	Graph Transformation Units - An Overview	claim
38	92	The Church-Turing Thesis over Arbitrary Domains	claim
39	86	The Seventies	claim
40	85	Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories	claim
41	84	A Framework for Formalizing Set Theories Based on the Use of Static Set Terms	claim
42	79	StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes	claim
43	74	Proof Search Tree and Cut Elimination	claim
44	67	Declarative Debugging of Membership Equational Logic Specifications	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers