LEADER 02523nam 2200625 450 001 9910463942303321 005 20200520144314.0 010 $a0-19-021724-3 010 $a0-19-021723-5 035 $a(CKB)2670000000606965 035 $a(EBL)2000876 035 $a(SSID)ssj0001460194 035 $a(PQKBManifestationID)12629935 035 $a(PQKBTitleCode)TC0001460194 035 $a(PQKBWorkID)11465647 035 $a(PQKB)10328712 035 $a(MiAaPQ)EBC2000876 035 $a(Au-PeEL)EBL2000876 035 $a(CaPaEBR)ebr11038107 035 $a(CaONFJC)MIL759750 035 $a(OCoLC)908098551 035 $a(EXLCZ)992670000000606965 100 $a20150410h20152015 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe trouble with lawyers /$fDeborah L. Rhode 210 1$aNew York, New York :$cOxford University Press,$d2015. 210 4$d©2015 215 $a1 online resource (245 p.) 300 $aIncludes index. 311 $a0-19-021722-7 311 $a1-336-28464-1 327 $aCover; Contents; Acknowledgments; 1. Introduction; 2. The Conditions of Practice; 3. Access to Justice; 4. Diversity in the Profession; 5. Regulation of the Profession; 6. Legal Education; 7. Conclusion; Notes; Index 330 $aBy any measure, the law as a profession is in serious trouble. Americans' trust in lawyers is at a low, and many members of the profession wish they had chosen a different path. Law schools, with their endlessly rising tuitions, are churning out too many graduates for the jobs available. Yet despite the glut of lawyers, the United States ranks 67th (tied with Uganda) of 97 countries in access to justice and affordability of legal services. The upper echelons of the legal establishment remain heavily white and male. Most problematic of all, the professional organizations that could help remedy 606 $aPractice of law$zUnited States 606 $aLegal ethics$zUnited States 606 $aLawyers$zUnited States 606 $aAttorney and client$zUnited States 608 $aElectronic books. 615 0$aPractice of law 615 0$aLegal ethics 615 0$aLawyers 615 0$aAttorney and client 676 $a347.73/504 700 $aRhode$b Deborah L.$0899066 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910463942303321 996 $aThe trouble with lawyers$92156139 997 $aUNINA LEADER 04248nam 22007695 450 001 996465596003316 005 20230406061303.0 010 $a3-642-02348-7 024 7 $a10.1007/978-3-642-02348-4 035 $a(CKB)1000000000753990 035 $a(SSID)ssj0000319845 035 $a(PQKBManifestationID)11272089 035 $a(PQKBTitleCode)TC0000319845 035 $a(PQKBWorkID)10354535 035 $a(PQKB)11775268 035 $a(DE-He213)978-3-642-02348-4 035 $a(MiAaPQ)EBC3064305 035 $a(PPN)136306748 035 $a(EXLCZ)991000000000753990 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings /$fedited by Ralf Treinen 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XII, 391 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5595 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02347-9 327 $aAutomatic Termination -- Loops under Strategies -- Proving Termination of Integer Term Rewriting -- Dependency Pairs and Polynomial Path Orders -- Unique Normalization for Shallow TRS -- The Existential Fragment of the One-Step Parallel Rewriting Theory -- Proving Confluence of Term Rewriting Systems Automatically -- A Proof Theoretic Analysis of Intruder Theories -- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case -- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions -- YAPA: A Generic Tool for Computing Intruder Knowledge -- Well-Definedness of Streams by Termination -- Modularity of Convergence in Infinitary Rewriting -- A Heterogeneous Pushout Approach to Term-Graph Transformation -- An Explicit Framework for Interaction Nets -- Dual Calculus with Inductive and Coinductive Types -- Comparing Böhm-Like Trees -- The Derivational Complexity Induced by the Dependency Pair Method -- Local Termination -- VMTL?A Modular Termination Laboratory -- Tyrolean Termination Tool 2 -- From Outermost to Context-Sensitive Rewriting -- A Fully Abstract Semantics for Constructor Systems -- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) -- Unification in the Description Logic -- Unification with Singleton Tree Grammars -- Unification and Narrowing in Maude 2.4. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5595 606 $aMachine theory 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aMathematical logic 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aMathematical Logic and Foundations 615 0$aMachine theory. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aMathematical logic. 615 14$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aMathematical Logic and Foundations. 676 $a005.131 686 $aDAT 554f$2stub 686 $aSS 4800$2rvk 702 $aTreinen$b Ralf$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications 906 $aBOOK 912 $a996465596003316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA