Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Articles by Topics
Topic F. - Theory of Computation
Topic F.4 - MATHEMATICAL LOGIC AND FORMAL LANGUAGES

C. Baier:
Probabilistic Models for Reo Connector Circuits
/jucs_11_10/probabilistic_models_for_reo
page 1718 - 1748
Vol.11 / Issue 10
B. Courcelle, R. G. Downey, M. R. Fellows:
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals
/jucs_3_11/a_note_on_the
page 1194 - 1198
Vol.3 / Issue 11
M. J. Dinneen:
Too Many Minor Order Obstructions (For Parameterized Lower Ideals)
/jucs_3_11/too_many_minor_order
page 1199 - 1206
Vol.3 / Issue 11
I.A. Durand, S.R. Schwer:
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
/jucs_14_20/a_tool_for_reasoning
page 3282 - 3306
Vol.14 / Issue 20
F. Ferri, A. D'Ulizia, P. Grifoni:
Computational Models of Language Evolution: Challenges and Future Perspectives
/jucs_24_10/computational_models_of_language
page 1345 - 1377
Vol.24 / Issue 10
S. Foldes, P. L. Hammer:
Monotone, Horn and Quadratic Pseudo-Boolean Functions
/jucs_6_1/monotone_horn_and_quadratic
page 97 - 104
Vol.6 / Issue 1
J. Goldstine, M. Kappes, C.M. Kintala, H. Leung, A. Malcher, D. Wotschke:
Descriptional Complexity of Machines with Limited Resources
/jucs_8_2/descriptional_complexity_of_machines
page 193 - 234
Vol.8 / Issue 2
W. Gomaa:
Expressibility in ∑11
/jucs_14_10/expressibility_in_sigma
page 1654 - 1677
Vol.14 / Issue 10
D. Găină, K. Futatsugi, K. Ogata:
Constructor-based Logics
/jucs_18_16/constructor_based_logics
page 2204 - 2233
Vol.18 / Issue 16
S. Hartmann, S. Link:
Weak Functional Dependencies: Full Propositional Expressiveness for the Database Practitioner
/jucs_15_1/weak_functional_dependencies_full
page 112 - 156
Vol.15 / Issue 1
X. He, G. Du, L. Hong:
Graphic Deduction Based on Set
/jucs_26_10/graphic_deduction_based_on
page 1331 - 1342
Vol.26 / Issue 10
H. Ishihara, B. Khoussainov:
Effectiveness of the Completeness Theorem for an Intermediate Logic
/jucs_3_11/effectiveness_of_the_completeness
page 1255 - 1265
Vol.3 / Issue 11
V. Kreinovich, B.J. Kubica:
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
/jucs_16_18/from_computing_sets_of
page 2657 - 2685
Vol.16 / Issue 18
H. Köhler:
Global Database Design based on Storage Space and Update Time Minimization
/jucs_15_1/global_database_design_based
page 195 - 240
Vol.15 / Issue 1
A. Lamei, M.S. Fallah:
Rewriting-Based Enforcement of Noninterference in Programs with Observable Intermediate Values
/jucs_22_7/rewriting_based_enforcement_of
page 956 - 991
Vol.22 / Issue 7
M. Mac an Airchinnigh:
An Eclectic View of the Irish School of Constructive Mathematics, from [Lucas 1978] to [Mac an Airchinnigh 2001]
/jucs_7_8/an_eclectic_view_of
page 668 - 691
Vol.7 / Issue 8
H.R. Mahrooghi, R. Jalili:
An Algebraic Theory of Epistemic Processes
/jucs_19_10/an_algebraic_theory_of
page 1396 - 1432
Vol.19 / Issue 10
L. C. Paulson:
A Generic Tableau Prover and its Integration with Isabelle
/jucs_5_3/a_generic_tableau_prover
page 73 - 87
Vol.5 / Issue 3
G. Rosu:
Kan Extensions of Institutions
/jucs_5_8/kan_extensions_of_institutions
page 482 - 493
Vol.5 / Issue 8
B. Zouari:
A Structure Causality Relation for Liveness Characterisation in Petri Nets
/jucs_12_2/a_structure_causality_relation
page 214 - 232
Vol.12 / Issue 2